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

DOI10.1016/J.LAA.2024.02.025OpenAlexW4392303287MaRDI QIDQ6131334FDOQ6131334

Authors Lu Miao, Rui-fang Liu, Jingru 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

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

Recommendations

• Spectral extremal graphs for intersecting cliques
• The spectral radius of graphs with no intersecting odd cycles
• Extremal graphs for intersecting triangles
• Spectral extremal graphs for disjoint cliques
• The spectral radius of \(H_{2k}\)-free graphs

Cites Work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• A complete solution to the Cvetković–Rowlinson conjecture
• A unique characterization of spectral extrema for friendship graphs
• Bounds on graph eigenvalues. II
• Eigenvalues of complete multipartite graphs
• Extremal graphs for intersecting cliques
• Extremal graphs for intersecting triangles
• Extremal graphs for the \(k\)-flower
• Spectral extrema of graphs: forbidden hexagon
• Spectral extremal graphs for intersecting cliques
• Spectral extremal results with forbidding linear forests
• The maximum spectral radius of graphs without friendship subgraphs
• The spectral radius of graphs with no intersecting odd cycles
• The spectral radius of graphs with no odd wheels
• The spectral radius of graphs without long cycles
• The spectral radius of graphs without paths and cycles of specified length
• Three conjectures in extremal spectral graph theory
• Turán number and decomposition number of intersecting odd cycles

Cited In (3)

• Spectral extremal graphs without intersecting triangles as a minor
• Spectral Turán problems for intersecting even cycles
• The spectral radius of \(H_{2k}\)-free graphs

This page was built for publication: The unique spectral extremal graph for intersecting cliques or intersecting odd cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131334)