The unique spectral extremal graph for intersecting cliques or intersecting odd cycles

DOI10.1016/j.laa.2024.02.025OpenAlexW4392303287MaRDI QIDQ6131334

Lu Miao, Rui-fang Liu, Jing-Ru Zhang

Publication date: 5 April 2024

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2024.02.025

zbMATH Keywords

spectral radiusadjacency matrixintersecting odd cyclesspectral extremal graphintersecting cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Eigenvalues of complete multipartite graphs
• Spectral extrema of graphs: forbidden hexagon
• The spectral radius of graphs without paths and cycles of specified length
• Extremal graphs for intersecting cliques
• Spectral extremal results with forbidding linear forests
• The spectral radius of graphs without long cycles
• Extremal graphs for intersecting triangles
• Spectral extremal graphs for intersecting cliques
• The spectral radius of graphs with no intersecting odd cycles
• A unique characterization of spectral extrema for friendship graphs
• The maximum spectral radius of graphs without friendship subgraphs
• The spectral radius of graphs with no odd wheels
• Three conjectures in extremal spectral graph theory
• Turán number and decomposition number of intersecting odd cycles
• Bounds on graph eigenvalues. II
• Extremal graphs for the k‐flower
• A complete solution to the Cvetković–Rowlinson conjecture