All (k;g)-cages are edge-superconnected

  • Authors:

  • Yuqing Lin;Mirka Miller;C. Balbuena;X. Marcote

  • Affiliations:

  • School of Electrical Engineering and Computer Science, The University of Newcastle, NSW2308, Australia;School of Information Technology and Mathematical Sciences, University of Ballarat, Vic 3353, Australia;Departament de Matemàtica Aplicada III, Universitat Politècnica de Catalunya, Barcelona, Spain;Departament de Matemàtica Aplicada III, Universitat Politècnica de Catalunya, Barcelona, Spain

  • Venue:
  • Networks
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A (k;g)-cage is a k-regular graph with girth g and with the least possible number of vertices. In this article we prove that (k;g)-cages are edge-superconnected if g is even. Earlier, Marcote and Balbuena proved that (k;g)-cages are edge-superconnected if g is odd [Networks 43 (2004), 54–59]. Combining our results, we conclude that all (k;g)-cages are edge-superconnected. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(2), 102–110 2006