Characterizations of Line Simplicial Complexes
arXiv:1702.04623
Abstract
Let be a finite simple graph. The line graph represents the adjacencies between edges of . We define first the line simplicial complex of containing Gallai and anti-Gallai simplicial complexes and (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 is connected if and only if 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.
arXiv comment12 pages, 7 figures