Abstract
A $(k;g)$-graph is a $k$-regular graph with girth $g$. A $(k;g)$-cage is a $(k;g)$-graph with the smallest possible number of vertices. In this paper we prove that $(k;g)$-cages are $k$-edge-connected if $k \geq 3$ and $g$ is odd.
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.
