Premium
All ( k ; g )‐cages are edge‐superconnected
Author(s) -
Lin Yuqing,
Miller Mirka,
Balbuena C.,
Marcote X.
Publication year - 2006
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20092
Subject(s) - combinatorics , enhanced data rates for gsm evolution , cage , graph , mathematics , computer science , artificial intelligence
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