Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9512615 | Discrete Mathematics | 2005 | 10 Pages |
Abstract
A (δ,g)-cage is a δ-regular graph with girth g and with the least possible number of vertices. We prove that all (δ,g)-cages are r-connected with r⩾δ+1 for g⩾7 odd. This result supports the conjecture of Fu, Huang and Rodger that all (δ;g)-cages are δ-connected.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yuqing Lin, Mirka Miller, Camino Balbuena,