Premium
On the connectivity of semiregular cages
Author(s) -
Balbuena C.,
GonzálezMoreno D.,
Marcote X.
Publication year - 2010
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.20349
Subject(s) - combinatorics , cage , graph , mathematics , strongly connected component , connectivity , vertex connectivity , computer science , discrete mathematics , vertex (graph theory)
An ({ r , r + 1}; g )‐cage is a graph with degree set { r , r + 1}, girth g , and with the smallest possible order; every such graph is called a semiregular cage. In this article, semiregular cages are shown to be maximally edge‐connected and 2‐connected. As a consequence, ({3, 4}; g )‐cages are proved to be maximally connected. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010