On the Representability of Line Graphs

Abstract

A graph G = (V, E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) is in E for each x not equal to y. The motivation to study representable graphs came from algebra, but this subject is interesting from graph theoretical, computer science, and combinatorics on words points of view.In this paper, we prove that for n greater than 3, the line graph of an n-wheel is non-representable. This not only provides a new construction of non-representable graphs, but also answers an open question on representability of the line graph of the 5-wheel, the minimal non-representable graph. Moreover, we show that for n greater than 4, the line graph of the complete graph is also non-representable. We then use these facts to prove that given a graph G which is not a cycle, a path or a claw graph, the graph obtained by taking the line graph of G k-times is guaranteed to be non-representable for k greater than 3.

Colloquium : Zoo of quantum-topological phases of matter

“…Regarding to Pt.6 in Sec. II, some people define those states with no topological excitations as short-range entangled [59]. However, since those states have non-zero chiral central charges c for the edge states, they cannot smoothly change to product state without phase transition.…”

A Comprehensive Introduction to the Theory of Word-Representable Graphs

“…The line graph of a graph G = (V, E) is the graph with vertex set E in which two vertices are adjacent if and only if the corresponding edges Theorem 34 ( [19]). Let n ≥ 4.…”

Word-representability of triangulations of grid-covered cylinder graphs

“…V m−1 and V 0 ). For example, referring to Figure 2.4, the layer L 2 is the induced subgraph formed by the vertices {v 10 , v 11 , v 12 , v 13 , v 20 , v 21 , v 22 , v 23 }, while the sector S 3 is the induced subgraph formed by the vertices {v 02 , v 12 , v 22 , v 03 , v 13 , v 23 }.…”