Connectivity of Cages

Hung-Lin Fu*, K. C. Huang, C. A. Rodger

*Corresponding author for this work

研究成果: Article同行評審

40 引文 斯高帕斯(Scopus)

摘要

A (k; g)-graph is a k-regular graph with girth g. Let f(k; g) be the smallest integer v such there exists a (k; g)-graph with v vertices. A (k; g)-cage is a (k; g)-graph with f(k; g) vertices. In this paper we prove that the cages are monotonic in that f(k; g1) < f(k; g2) for all k ≥ 3 and 3 ≤ g1 ≤ g2. We use this to prove that (k; g)-cages are 2-connected, and if k = 3 then their connectivity is k.

原文English
頁(從 - 到)187-191
頁數5
期刊Journal of Graph Theory
24
發行號2
DOIs
出版狀態Published - 1 一月 1997

指紋 深入研究「Connectivity of Cages」主題。共同形成了獨特的指紋。

引用此