A Note on the Degree Monotonicity of Cages

Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7626

Full metadata record

DC Field	Value	Language
dc.contributor.author	P. Wang	-
dc.contributor.author	Q.L. Yu	-
dc.date.accessioned	2024-02-27T06:20:35Z	-
dc.date.available	2024-02-27T06:20:35Z	-
dc.date.issued	2005	-
dc.identifier.uri	http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7626	-
dc.description.abstract	A (k g)-graph is a k-regular graph with girth g. A (k g)-cage is a (k g)-graph with the least number of vertices. The order of a (k g)cage is denoted by J(k g) . In this paper we show that J(k + 2 g) ~ f(k g) for k ~ 2 and present some partial results to support the conjecture that J(k1g) < J(k2g) if k1 < k2 .	-
dc.publisher	Bulletin of the Institute of Combinatorics and Its Applications	-
dc.title	A Note on the Degree Monotonicity of Cages	-
dc.vol	Vol 43	-
Appears in Collections:	Articles to be qced

Files in This Item:

File	Size	Format
A note on the degree monotonicity of cages.pdf	1.58 MB	Adobe PDF	View/Open

Alliance University, Bengaluru