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)

Cites Work

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

Cited In (1)

• Spectral extremal graphs without intersecting triangles as a minor

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)