Skip to Main content Skip to Navigation
Journal articles

Some properties of semiregular cages

Abstract : A graph with degree set \r, r + 1\ is said to be semiregular. A semiregular cage is a semiregular graph with given girth g and the least possible order. First, an upper bound on the diameter of semiregular graphs with girth g and order close enough to the minimum possible value is given in this work. As a consequence, these graphs are proved to be maximally connected when the girth g >= 7 is odd. Moreover an upper bound for the order of semiregular cages is given and, as an application, every semiregular cage with degree set \r, r + 1\ is proved to be maximally connected for g is an element of \6, 8\, and when g = 12 for r >= 7 and r not equal 20. Finally it is also shown that every (\r, r + 1\; g)-cage is 3-connected.
Document type :
Journal articles
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, May 13, 2014 - 3:37:39 PM
Last modification on : Monday, November 16, 2020 - 3:56:03 PM
Long-term archiving on: : Monday, April 10, 2017 - 10:19:44 PM


Files produced by the author(s)




Camino Balbuena, Xavier Marcote, Diego Gonzalez-Moreno. Some properties of semiregular cages. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, Vol. 12 no. 5 (5), pp.125-138. ⟨10.46298/dmtcs.499⟩. ⟨hal-00990460⟩



Record views


Files downloads