Diameter and connectivity of (D; g)-cages

References

• Alon , N. , Hoory , S. and Linial , N. 2002 . The Moore bound for irregular graphs . Graphs Combin. , 18 : 53 – 57 .
   Google Scholar
• Araujo , G. , González , D. , Montellano , J. J. and Serra , O. 2007 . On upper bounds and connectivity of cages . Australa. J. Combin. , 38 : 221 – 228 .
   Google Scholar
• Araujo-Pardo , G. , Balbuena , C. , García-Vázquez , P. , Marcote , X. and Valenzuela , J. C. 2008 . On the order of ({r, m}; g)-cages of even girth . Discrete Math. , 308 ( 12 ) : 2484 – 2491 .
   Google Scholar
• Araujo-Pardo , G. , Balbuena , C. and Valenzuela , J. C. 2009 . Constructions of bi-regular cages . Discrete Math. , 309 ( 6 ) : 1409 – 1416 .
   Google Scholar
• Balbuena , C. and Marcote , X. Monotonicity of the order of (D; g)-cages . pre print, submitted for publication
   Google Scholar
• Balbuena , C. , Carmona , A. , Fàbrega , J. and Fiol , M. A. 1996 . On the connectivity and the conditional diameter of graphs and digraphs . Networks , 28 : 97 – 105 .
   Google Scholar
• Balbuena , M. C. , Carmona , A. , Fàbrega , J. and Fiol , M. A. 1997 . On the order and size of s-geodetic digraphs with given connectivity . Discrete Math. , 174 : 19 – 27 .
   Google Scholar
• Balbuena , C. , Fàbrega , J. , Marcote , X. and Pelayo , I. 2002 . Superconnected digraphs and graphs with small conditional diameters . Networks , 39 ( 3 ) : 153 – 160 .
   Google Scholar
• Chartrand , G. and Lesniak , L. 1996 . Graphs and digraphs , 3 , London : Chapman and Hall .
   Google Scholar
• Chartrand , G. , Gould , R. J. and Kapoor , S. F. 1981 . Graphs with prescribed degree sets and girth . Period. Math. Hungar , 12 ( 4 ) : 261 – 266 .
   Google Scholar
• Daven , M. and Rodger , C. A. 1999 . (k; g)-cages are 3-connected . Discrete Math. , 199 : 207 – 215 .
   Web of Science ®Google Scholar
• Downs , M. , Gould , R. J. , Mitchem , J. and Saba , F. 1981 . (D; n)-cages . Congr. Numer. , 32 : 179 – 193 .
   Google Scholar
• Erdős , P. and Sachs , H. 1963 . Regulare Graphen gegebener Taillenweite mit minimaler Knotenzahl . Wiss. Z. Uni. Halle (Math. Nat.) , 12 : 251 – 257 .
   Google Scholar
• Exoo , G. and Jajcay , R. 2008 . Dynamic cage survey . Electron. J. Combin. , 15 #DS16
   Google Scholar
• Fàbrega , J. and Fiol , M. A. 1989 . Maximally connected digraphs . J. Graph Theory , 13 : 657 – 668 .
   Web of Science ®Google Scholar
• Fiol , M. A. , Fàbrega , J. and Escudero , M. 1990 . Short paths and connectivity in graphs and digraphs . Ars Combin. , 29B : 17 – 31 .
   Google Scholar
• Fu , H. L. , Huang , K. C. and Rodger , C. A. 1997 . Connectivity of cages . J. Graph Theory , 24 : 187 – 191 .
   Google Scholar
• Hanson , D. , Wang , P. and Jorgensen , L. K. 1992 . On cages with given degree sets . Discrete Math. , 101 : 109 – 114 .
   Google Scholar
• Holton , D. A. and Sheehan , J. 1993 . Cages in The Petersen Graph , Cambridge : Cambridge University . Chap. 6
   Google Scholar
• Jiang , T. and Mubayi , D. 1998 . Connectivity and separating sets of cages . J. Graph Theory , 29 : 35 – 44 .
   Google Scholar
• Kapoor , S. F. , Polimeni , A. D. and Wall , C. E. 1977 . Degree sets for graphs . Fund. Math. , 95 : 189 – 194 .
   Google Scholar
• Lin , Y. , Miller , M. and Balbuena , C. 2005 . Improved lower bound for the vertex connectivity of (δ; g)-cages . Discrete Math. , 299 : 162 – 171 .
   Google Scholar
• Lin , Y. , Balbuena , C. , Marcote , X. and Miller , M. 2008 . On the Connectivity of (k, g)-cages of even girth . Discrete Math , 308 ( 15 ) : 3249 – 3256 .
   Google Scholar
• Marcote , X. , Balbuena , C. , Pelayo , I. and Fàbrega , J. 2005 . (δ, g)-cages with g≥10 are 4-connected . Discrete Math. , 301 : 124 – 136 .
   Google Scholar
• Marcote , X. , Balbuena , C. and Pelayo , I. 2007 . On the connectivity of cages with girth five, six and eight . Discrete Math. , 307 : 1441 – 1446 .
   Google Scholar
• Sauer , N. 1967 . Extremaleigenschaften regulärer Graphen gegebener Taillenweite, I and II . Österreich. Acad. Wiss. Math.-Natur. Kl. Sitzungsber. II , 176 : 9 – 25 . 27–43
   Google Scholar
• Soneoka , T. , Nakada , H. and Imase , M. 1985 . Sufficient conditions for dense graphs to be maximally connected . Proc. ISCAS , 85 : 811 – 814 .
   Google Scholar
• Soneoka , T. , Nakada , H. , Imase , M. and Peyrat , C. 1987 . Sufficient conditions for maximally connected dense graphs . Discrete Math. , 63 : 53 – 66 .
   Web of Science ®Google Scholar
• Wong , P. K. 1982 . Cages–A survey . J. Graph Theory , 6 : 1 – 22 .
   Web of Science ®Google Scholar
• Xu , B. , Wang , P. and Wang , J. F. 2002 . On the connectivity of (4, g)-cages . Ars Combin. , 64 : 181 – 192 .
   Google Scholar
• Yuansheng , Y. and Liang , W. 2003 . The minimum number of vertices with girth 6 and degree set D={r, m} . Discrete Math. , 269 : 249 – 258 .
   Google Scholar