Spectral extrema of graphs: forbidden star-path forests

DOI10.1016/J.DISC.2024.114351MaRDI QIDQ7028871zbMATH OpenFDO

Authors Yanni Zhai, Xiying Yuan, Lihua You

Publication date 11 February 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114351

zbMATH Keywords

adjacency matrixextremal graphspectral radiusstar-path forest

Mathematics Subject Classification ID

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

Cites work

• A sharp upper bound of the spectral radius of graphs
• A Spectral Erdős-Sós Theorem
• Bounds on graph eigenvalues. II
• Connected graphs without long paths
• On a conjecture of spectral extremal problems
• On maximal paths and circuits of graphs
• On the spectral radius of graphs without a star forest
• On the Turán number of forests
• Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
• Some Inequalities for the Largest Eigenvalue of a Graph
• Spectral extremal results with forbidding linear forests
• Spectral radius of graphs with given matching number
• The maximum spectral radius of graphs without friendship subgraphs
• 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
• The Turán number of \(k \cdot S_\ell \)
• The Turán number of disjoint copies of paths
• The Turán number of star forests
• Three conjectures in extremal spectral graph theory
• Turán numbers for disjoint paths
• Turán numbers of multiple paths and equibipartite forests

Cited in

(1)

• A general theorem in spectral extremal graph theory

This page was built for publication: Spectral extrema of graphs: forbidden star-path forests

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