Spectral radius conditions for the existence of all subtrees of diameter at most four

DOI10.1016/j.laa.2023.01.004OpenAlexW4315607660MaRDI QIDQ2685383

Xiangxiang Liu, Li-Gong Wang, Hajo J. Broersma

Publication date: 21 February 2023

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

Full work available at URL: https://arxiv.org/abs/2109.11546

zbMATH Keywords

spectral radiusBrualdi-Solheid-Turán-type problemtrees of diameter at most four

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (2)

Spectral extrema of graphs with bounded clique number and matching number ⋮ A Spectral Erdős-Sós Theorem

Cites Work

• On the Turán number of forests
• Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
• Spectral extrema of graphs: forbidden hexagon
• A contribution to the Zarankiewicz problem
• The spectral radius of graphs without paths and cycles of specified length
• Spectral bounds for the clique and independence numbers of graphs
• Spectral extremal results with forbidding linear forests
• The spectral radius of graphs without long cycles
• The Colin de Verdière parameter, excluded minors, and the spectral radius
• The maximum spectral radius of graphs without friendship subgraphs
• A spectral version of Mantel's theorem
• Adjacency eigenvalues of graphs without short odd cycles
• The spectral radius of graphs with no odd wheels
• Spectral extrema for graphs: the Zarankiewicz problem
• A spectral condition for odd cycles in graphs
• On the spectral radius of graphs without a star forest
• The spectral radius of graphs without trees of diameter at most four
• The Erdős‐Sós Conjecture for trees of diameter four

This page was built for publication: Spectral radius conditions for the existence of all subtrees of diameter at most four