Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/14891
ชื่อเรื่อง: The forest number of (n,m)-Graphs
ผู้แต่ง: Chantasartrassmee A.
Punnim N.
Keywords: C (programming language)
Computation theory
Computational geometry
Forestry
Graphic methods
Connected graph
Extremal
Line segment
Positive integers
Graph theory
วันที่เผยแพร่: 2008
บทคัดย่อ: Let G = (V,E) be a graph and F ⊆ V. Then F is called an induced forest of G if G[F] is acyclic. The forest number, denoted by f(G), of G is defined by f(G) := max {|F| : F is an induced forest of G}. We proved that if G runs over the set of all graphs of order n and size m, then the values f(G) completely cover a line segment [x,y] of positive integers. Let ς(n,m) be the set of all graphs of order n and size m and Cς(n, m) be the subset of consisting of all connected graphs. We are able to obtain the extremal results for the forest number in the class ς(n, m) and Cς(n, m). © 2008 Springer Berlin Heidelberg.
URI: https://ir.swu.ac.th/jspui/handle/123456789/14891
https://www.scopus.com/inward/record.uri?eid=2-s2.0-70349923416&doi=10.1007%2f978-3-540-89550-3_4&partnerID=40&md5=c93c38548618a814964c9ca4668b80ce
ISSN: 3029743
Appears in Collections:Scopus 1983-2021

Files in This Item:
There are no files associated with this item.


Items in SWU repository are protected by copyright, with all rights reserved, unless otherwise indicated.