Computational determination of (3,11) and (4,7) cages
From MaRDI portal
Publication:553952
DOI10.1016/J.JDA.2010.11.001zbMATH Open1217.90155arXiv1009.3608OpenAlexW1581883634MaRDI QIDQ553952FDOQ553952
Authors: Geoffrey Exoo, Brendan D. McKay, Jacqueline Nadon, Wendy Myrvold 
Publication date: 29 July 2011
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Abstract: A (k,g)-graph is a k-regular graph of girth g, and a (k,g)-cage is a (k,g)-graph of minimum order. We show that a (3,11)-graph of order 112 found by Balaban in 1973 is minimal and unique. We also show that the order of a (4,7)-cage is 67 and find one example. Finally, we improve the lower bounds on the orders of (3,13)-cages and (3,14)-cages to 202 and 260, respectively. The methods used were a combination of heuristic hill-climbing and an innovative backtrack search.
Full work available at URL: https://arxiv.org/abs/1009.3608
Recommendations
Cites Work
Cited In (9)
- Codes for distributed storage from 3-regular graphs
- Title not available (Why is that?)
- Maximizing algebraic connectivity for certain families of graphs
- On decreasing the orders of \((k,g)\)-graphs
- Title not available (Why is that?)
- Applications of integer programming methods to cages
- Attainable bounds for algebraic connectivity and maximally connected regular graphs
- A note on the problem of finding a (3,9)-cage
- The 10-cages and derived configurations
This page was built for publication: Computational determination of (3,11) and (4,7) cages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553952)
