On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
type: Item
instance of: scholarly article
title: On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
zbMATH Open document ID: 0808.05047
DOI: 10.1016/0012-365X(94)90036-1
author: D. Frank Hsu
author: Tomasz Łuczak
published in: Discrete Mathematics
publication date: 1994-12-08T00:00:00Z
review text: The authors study the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs. The \(k\)-diameter of a graph \(G\) is the maximum diameter of the graphs obtained from \(G\) by removing \(k-1\) vertices. It is shown that every \(k\)- regular \(k\)-connected graph on \(n\) vertices has \(k\)-diameter at most \(n/2\) and this upper bound can be achieved at some graphs.
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 681708
zbMATH Keywords: \(k\)-regular \(k\)-connected graphs
zbMATH Keywords: diameter
zbMATH Keywords: upper bound
reviewed by: Du Ding-Zhu
MaRDI profile type: Publication
cites work: Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
cites work: Q3794217
cites work: Q3753503
Recommended article: On generalized \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
Recommended article: On \(k\)-diameter of \(k\)-connected graphs
Recommended article: On the diameter of Kneser graphs
Recommended article: On bounding the diameter of a distance-regular graph
Recommended article: A bound for the diameter of distance-regular graphs
Recommended article: Bounding the diameter of a distance regular graph by a function of \(k_ d\)
Recommended article: On the diameter of generalized Kneser graphs
Recommended article: Bounding the diameter of a distance regular graph by a function of \(k_ d\). II
Recommended article: Q3033789
Recommended article: On diameters of 2-regular graphs
description: scientific article; zbMATH DE number 681708