2022
DOI: 10.26493/2590-9770.1434.bf4
|View full text |Cite
|
Sign up to set email alerts
|

Topology of clique complexes of line graphs

Abstract: The clique complex of a graph G is a simplicial complex whose simplices are all the cliques of G, and the line graph L(G) of G is a graph whose vertices are the edges of G and the edges of L(G) are incident edges of G. In this article, we determine the homotopy type of the clique complexes of line graphs for several classes of graphs including trianglefree graphs, chordal graphs, complete multipartite graphs, wheel-free graphs, and 4-regular circulant graphs. We also give a closed form formula for the homotopy… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…The following result is proved in [9]. This is an important method to investigate the homotopy type of a complex by splitting it into two or more subcomplexes.…”
Section: Notations and Preliminary Resultsmentioning
confidence: 97%
“…The following result is proved in [9]. This is an important method to investigate the homotopy type of a complex by splitting it into two or more subcomplexes.…”
Section: Notations and Preliminary Resultsmentioning
confidence: 97%
“…For example, he used star clusters to show that the independence complex of any triangle-free graph has the homotopy type of a suspension and that the independence complex of a forest is either contractible or homotopy equivalent to a sphere. K. Iriye used star clusters to construct a matching tree for the independence complex of square grids with cyclic identification [8], and S. Goyal et al used star clusters to compute the homotopy type of the independence complexes of generalised Mycielskian of complete graphs [6]. Another important tool in combinatorial topology is the Cluster lemma.…”
Section: Introductionmentioning
confidence: 99%