A note on the edge-connectivity of cages (Q1871385)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the edge-connectivity of cages |
scientific article |
Statements
A note on the edge-connectivity of cages (English)
0 references
7 May 2003
0 references
Summary: 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. We prove that \((k;g)\)-cages are \(k\)-edge-connected if \(k\geq 3\) and \(g\) is odd.
0 references
girth
0 references
\((k
0 references
g)\)-cage
0 references
