Maximum degree growth of the iterated line graph (Q1295988): Difference between revisions

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.