Abstract
A (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs with girth g. It has been conjectured that the connectivity of each (k, g-cage is k, and a proof exists for k = 3. We prove here that all cages are 3-connected, a step towards a proof of the conjecture.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
