Forbidden induced subgraphs in iterative higher order line graphs

Abstract

Let $G$ be a simple finite connected graph. The line graph $L(G)$ of graph $G$ is the graph whose vertices are the edges of $G$, where $ef \in E(L(G))$ when $e \cap f \neq \emptyset$. Iteratively, the higher order line graphs are defined inductively as $L^1(G) = L(G)$ and $L^n(G) = L(L^{n-1}(G))$ for $n \geq 2$. In [Derived graphs and digraphs, Beitrage zur Graphentheorie (Teubner, Leipzig 1968), 17--33 (1968)], Beineke characterize line graphs in terms of nine forbidden subgraphs. Inspired by this result, in this paper, we characterize second order line graphs in terms of pure forbidden induced subgraphs. We also give a sufficient list of forbidden subgraphs for a graph $G$ such that $G$ is a higher order line graph. We characterize all order line graphs of graph $G$ with $Δ(G) = 3$ and $4$.

Figures (4)

• Figure 1: Graphs $K_{1,3}$, $K_3$ and its line graphs.
• Figure 2: Graphs $E_1$, $E_2$ and $E_3$.
• Figure 3: The nine forbidden induced subgraphs in line graphs.
• Figure 4: Three forbidden induced subgraphs in line graphs.

Theorems & Definitions (24)

• Theorem 1.1
• Theorem 1.3
• Theorem 1.4
• Theorem 1.5
• Corollary 1.6
• Theorem 1.7
• Theorem 1.8
• Theorem 1.10
• proof
• Corollary 1.11