Constrained switchings in cubic graphs

Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/15001

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chantasartrassmee A.
dc.contributor.author	Punnim N.
dc.date.accessioned	2021-04-05T04:32:18Z	-
dc.date.available	2021-04-05T04:32:18Z	-
dc.date.issued	2006
dc.identifier.issn	3817032
dc.identifier.other	2-s2.0-33845596233
dc.identifier.uri	https://ir.swu.ac.th/jspui/handle/123456789/15001	-
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-33845596233&partnerID=40&md5=7517d3a5ea3ba9e8dd2fad41cbbc853e
dc.description.abstract	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).
dc.title	Constrained switchings in cubic graphs
dc.type	Article
dc.rights.holder	Scopus
dc.identifier.bibliograpycitation	Ars Combinatoria. Vol 81, (2006), p.65-79
Appears in Collections:	Scopus 1983-2021

Files in This Item:

There are no files associated with this item.