A note on the edge-connectivity of cages (Q1871385): Difference between revisions
From MaRDI portal
Removed claims |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / author | |||
| Property / author: Bao-guang Xu / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Jian-fang Wang / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 05:00, 5 March 2024
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
