The spectral radius of graphs without trees of diameter at most four

DOI10.1080/03081087.2019.1628911OpenAlexW2962951545WikidataQ127710800 ScholiaQ127710800MaRDI QIDQ4992649

Chenhui Lv, Jun Gao, Boyuan Liu, Shi Cheng Wang, Xin Min Hou

Publication date: 9 June 2021

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

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

zbMATH Keywords

spectral radiusErdős-Sós conjectureBrualdi-Solheid-Turán type problem

Mathematics Subject Classification ID

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

Related Items (6)

On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees ⋮ Spectral extrema of graphs with bounded clique number and matching number ⋮ A Spectral Erdős-Sós Theorem ⋮ The maximum spectral radius of graphs without spanning linear forests ⋮ Spectral radius conditions for the existence of all subtrees of diameter at most four ⋮ An \(A_{\alpha}\)-spectral Erdős-Sós theorem

Cites Work

• The spectral radius of graphs without paths and cycles of specified length
• The spectral radius of graphs without long cycles
• Some new results in extremal graph theory
• On maximal paths and circuits of graphs
• The Erdős‐Sós Conjecture for trees of diameter four

This page was built for publication: The spectral radius of graphs without trees of diameter at most four