Super connectivity of line graphs and digraphs (Q2431926)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5066732
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Super connectivity of line graphs and digraphs |
scientific article; zbMATH DE number 5066732 |
Statements
Super connectivity of line graphs and digraphs (English)
0 references
24 October 2006
0 references
The authors establish the relationship between the \(h\)-super edge-connectivity of a graph and the super connectivity of its line graph. Furthermore, the authors show that the de Bruijn digraph \(B(d,n)\) and the Kautz digraph \(K(d,n)\) are both super connected for any \(d>1\) and \(n>0\).
0 references
super edge-connectivity
0 references
de Bruijn digraphs
0 references
Kautz digraphs
0 references
0.8648137450218201
0 references
0.8538268804550171
0 references
0.8511380553245544
0 references
0.8501537442207336
0 references
0.8501537442207336
0 references
