The maximum spectral radius of graphs without spanning linear forests

DOI10.1007/S00373-022-02608-6zbMath1505.05075OpenAlexW4313255482MaRDI QIDQ2680576

Yanyan Li

Publication date: 4 January 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02608-6

zbMATH Keywords

linear foreststar forestKelmans transformationspectral extremal graph theory

Mathematics Subject Classification ID

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

Related Items (2)

Spectral radius and rainbow Hamilton paths of a graph ⋮ On the spectral Turán problem of theta graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
• Applications of the Kelmans transformation: extremality of the threshold graphs
• Spectral extrema of graphs: forbidden hexagon
• A contribution to the Zarankiewicz problem
• Spectral radius of graphs with given matching number
• The spectral radius of graphs without paths and cycles of specified length
• The maximum spectral radius of \(C_4\)-free graphs of given order and size
• On a conjecture of V. Nikiforov
• Spectral extremal results with forbidding linear forests
• The spectral radius of graphs without long cycles
• The sharp upper bounds on the \(A_{\alpha}\)-spectral radius of \(C_4\)-free graphs and Halin graphs
• The generalized Turán number of spanning linear forests
• The spectral radius of graphs with no intersecting odd cycles
• The spectral Turán problem about graphs with no 6-cycle
• The formula for Turán number of spanning linear forests
• The maximum spectral radius of graphs without friendship subgraphs
• The spectral radius of graphs with no odd wheels
• The shifting method and generalized Turán number of matchings
• Spectral extrema for graphs: the Zarankiewicz problem
• Three conjectures in extremal spectral graph theory
• Bounds on graph eigenvalues. II
• On the spectral radius of graphs without a star forest
• The maximum spectral radius of wheel-free graphs
• Some new results in extremal graph theory
• On maximal paths and circuits of graphs
• On the size of graphs with complete-factors
• The spectral radius of graphs without trees of diameter at most four
• The History of Degenerate (Bipartite) Extremal Graph Problems

This page was built for publication: The maximum spectral radius of graphs without spanning linear forests