Maximum degree growth of the iterated line graph (Q1295988): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 03:49, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximum degree growth of the iterated line graph |
scientific article |
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