Maximum Degree Growth of the Iterated Line Graph

Let k denote the maximum degree of the kth iterated line graph Lk(G). For any connected graph G that is not a path, the inequality k+1 2k - 2 holds. Niepel, Knor, and Solt

• Type: Journal
• Year: 1999
• Where: COMBINATORICS
• Authors: Stephen G. Hartke, Aparna W. Higgins
• Keywords: COMBINATORICS 1999, Connected Graph, Line Graph, Maximum Degree