A Note on the Edge-Connectivity of Cages
A $(k;g)$-graph is a $k$-regular graph with girth $g$. A $(k;g)$-cage is a $(k;g)$-graph with the smallest possible number of vertices. In this paper we prove that $(k;g)$-cages are $k$-edge-connected if $k \geq 3$ and $g$ is odd.
Gespeichert in:
| Veröffentlicht in: | The Electronic journal of combinatorics 2003-04, Vol.10 (1) |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | A $(k;g)$-graph is a $k$-regular graph with girth $g$. A $(k;g)$-cage is a $(k;g)$-graph with the smallest possible number of vertices. In this paper we prove that $(k;g)$-cages are $k$-edge-connected if $k \geq 3$ and $g$ is odd. |
|---|---|
| ISSN: | 1077-8926 1077-8926 |
| DOI: | 10.37236/1742 |