Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7626
Title: A Note on the Degree Monotonicity of Cages
Authors: P. Wang
Q.L. Yu
Issue Date: 2005
Publisher: Bulletin of the Institute of Combinatorics and Its Applications
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 .
URI: http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7626
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
A note on the degree monotonicity of cages.pdf1.58 MBAdobe PDFView/Open


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