Maximum degree growth of the iterated line graph (Q1295988)
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 1314213
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum degree growth of the iterated line graph |
scientific article; zbMATH DE number 1314213 |
Statements
Maximum degree growth of the iterated line graph (English)
0 references
8 July 1999
0 references
Let \(\Delta_k\) denote the maximum degree of the \(k\)th iterated line graph of \(G\). It is proved that for every connected graph \(G\) that is not a path, there exists an integer \(K\) such that \(\Delta_k=2\Delta_{k-1}-2\) for all \(k\geq K\); that is, the maximum degree \(\Delta_k\) attains the greatest possible growth.
0 references
line graph
0 references
maximum degree
0 references
0.8274016380310059
0 references
0.8037744760513306
0 references
0.8032251596450806
0 references
