On the homotopy type of the iterated clique graphs of low degree
Mauricio Islas-G\'omez, Rafael Villarroel-Flores

TL;DR
This paper explores the topological properties of iterated clique graphs of low degree graphs, showing they have simple homotopy types and are invariant under the clique graph operator, extending known results for Helly graphs.
Contribution
It proves that all low degree graphs have the homotopy type of wedges or circles and are K-homotopy permanent, generalizing previous results for Helly graphs.
Findings
Low degree graphs have homotopy type of wedges or circles.
All low degree graphs are K-homotopy permanent.
K^2(G) is Helly for all low degree graphs.
Abstract
To any simple graph \(G\), the clique graph operator \(K\) assigns the graph \(K(G)\) which is the intersection graph of the maximal complete subgraphs of \(G\). The iterated clique graphs are defined by \(K^{0}(G)=G\) and \(K^{n}(G)=K(K^{n-1}(G))\) for \(n\geq 1\). We associate topological concepts to graphs by means of the simplicial complex \(\mathrm{Cl}(G)\) of complete subgraphs of \(G\). Hence we say that the graphs \(G_{1}\) and \(G_{2}\) are homotopic whenever \(\mathrm{Cl}(G_{1})\) and \(\mathrm{Cl}(G_{2})\) are. A graph \(G\) such that \(K^{n}(G)\simeq G\) for all \(n\geq1\) is called \emph{\(K\)-homotopy permanent}. A graph is \emph{Helly} if the collection of maximal complete subgraphs of \(G\) has the Helly property. Let \(G\) be a Helly graph. Escalante (1973) proved that \(K(G)\) is Helly, and Prisner (1992) proved that \(G\simeq K(G)\), and so Helly graphs are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · HIV Research and Treatment · Retinoids in leukemia and cellular processes
