1097-0037/asset/NET_centre.gif?v=1&s=3b4a007baeb0bb143afbd4cdc905958e631876aa)
On the connectivity of semiregular cages
Article first published online: 19 OCT 2009
DOI: 10.1002/net.20349
Copyright © 2009 Wiley Periodicals, Inc.
1097-0037/asset/cover.gif?v=1&s=ecd753a2b50d85eda1392633ee6b4b9b5040a7ed "Networks")
Additional Information
How to Cite
Balbuena, C., González-Moreno, D. and Marcote, X. (2010), On the connectivity of semiregular cages. Networks, 56: 81–88. doi: 10.1002/net.20349
Publication History
- Issue published online: 16 JUL 2010
- Article first published online: 19 OCT 2009
- Manuscript Accepted:
- Manuscript Received:
Funded by
- European Regional Development Fund (ERDF). Grant Number: MTM2008-06620-C03-02/MTM
- Ministry of Education and Science, Spain
- CoNACyT
- Abstract
- References
- Cited By
Keywords:
- cage;
- degree set;
- girth;
- semiregular cage;
- connectivity
Abstract
An ({r, r + 1}; g)-cage is a graph with degree set {r, r + 1}, girth g, and with the smallest possible order; every such graph is called a semiregular cage. In this article, semiregular cages are shown to be maximally edge-connected and 2-connected. As a consequence, ({3, 4}; g)-cages are proved to be maximally connected. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010