Spectral extremal problems for graphs with bounded clique number

DOI10.1016/J.LAA.2025.01.043MaRDI QIDQ7018413zbMATH OpenFDO

Authors Tingting Wang, Lihua Feng, Lu Lu

Publication date 5 March 2025

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

Full work available at URL https://doi.org/10.1016/J.LAA.2025.01.043

zbMATH Keywords

spectral radiusclique numberspectral Turán number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3652374 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• A Spectral Erdős-Sós Theorem
• Bounds on graph eigenvalues. II
• Connected graphs without long paths
• Degree powers in graphs with a forbidden even cycle
• Extremal graphs without long paths and large cliques
• On arithmetic progressions of cycle lengths in graphs
• On maximal paths and circuits of graphs
• On spectral radius and energy of complete multipartite graphs
• Spectral extrema of \(\{ K_{k + 1}, \mathcal{L}_s \}\)-free graphs
• Spectral extrema of graphs with bounded clique number and matching number
• Spectral radii of graphs with given chromatic number
• The maximum number of edges in a \(\{K_{r+1},M_{k+1}\}\)-free graph
• The spectral even cycle problem
• The spectral radius of graphs without paths and cycles of specified length
• Turán graphs with bounded matching number
• Vraagstuk XXVIII.

Cited in

(1)

• Spectral extrema of graphs: forbidden cliques and star forests

This page was built for publication: Spectral extremal problems for graphs with bounded clique number

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