Characterizations of Line Simplicial Complexes
Abstract
Let G be a finite simple graph. The line graph L(G) represents the adjacencies between edges of G. We define first the line simplicial complex L(G) of G containing Gallai and anti-Gallai simplicial complexes (G) and '(G) (respectively) as spanning subcomplexes. The study of connectedness of simplicial complexes is interesting due to various combinatorial and topological aspects. In Theorem 3.3, we prove that the line simplicial complex L(G) is connected if and only if G is connected. In Theorem 3.4, we establish the relation between Euler characteristics of line and Gallai simplicial complexes. In Section 4, we discuss the shellability of line and anti-Gallai simplicial complexes associated to various classes of graphs.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.