Spectral extremal graphs for intersecting cliques

• Published in: Linear algebra and its applications Vol. 644; pp. 234 - 258
• Main Authors: Desai, Dheer Noal, Kang, Liying, Li, Yongtao, Ni, Zhenyu, Tait, Michael, Wang, Jing
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier Inc 01.07.2022; American Elsevier Company, Inc
• Subjects: Extremal graph; Graph theory; Graphs; Intersecting cliques; Linear algebra; Spectral radius; Stability method; Intersecting cliques; 05C50; Spectral radius; Extremal graph; Stability method; 15A69; 05C35

The (k,r)-fan is the graph consisting of k copies of the complete graph Kr which intersect in a single vertex, and is denoted by Fk,r. Erdős et al. (1995) [14] determined the maximum number of edges in an n-vertex graph that does not contain Fk,3 as a subgraph. Furthermore, Chen et al. (2003) [5] pr...