Shuchita Goyal, Samir Shukla, Anurag Singh
Published 2020-09-25Version 1
Clique complex of a line graph is a functor from the category of graphs to the category of simplicial complexes. Using functorial properties of this functor, we determine the homotopy type of clique complexes of line graphs for several classes of graphs. Among others, we study triangle free graphs, wheel free graphs, 4-regular circulant graphs, chordal graphs, and complete multipartite graphs. We also give a closed form formula for the homotopy type of these complexes in several cases.
The p-Domination Number of Complete Multipartite Graphs
On D.K. Biss' papers "The homotopy type of the matroid Grassmannian" and "Oriented matroids, complex manifolds, and a combinatorial model for BU"
Interval minors of complete multipartite graphs
![QR code for arXiv:2009.12130 [math.CO]](http://oss.arxitics.com/images/favicon.svg)