Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/15001
ชื่อเรื่อง: Constrained switchings in cubic graphs
ผู้แต่ง: Chantasartrassmee A.
Punnim N.
วันที่เผยแพร่: 2006
บทคัดย่อ: The graph R(d) of realizations of d is a graph whose vertices are the graphs with degree sequence d, two vertices are adjacent in the graph R(d) if one can be obtained from the other by a switching. It has been shown that the graph R(d) is connected. Let CR(d) be the set of connected graphs with degree sequence d. Taylor [13] proved that the subgraph of R(d) induced by CR(d) is connected. Several connected subgraphs of CR(3n) are obtained in this paper. As an application, we are able to obtain the interpolation and extremal results for the number of maximum induced forests in the classes of connected subgraphs of CR,(3n).
URI: https://ir.swu.ac.th/jspui/handle/123456789/15001
https://www.scopus.com/inward/record.uri?eid=2-s2.0-33845596233&partnerID=40&md5=7517d3a5ea3ba9e8dd2fad41cbbc853e
ISSN: 3817032
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.