On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees
From MaRDI portal
Publication:2675869
DOI10.1016/j.disc.2022.113112zbMath1497.05154arXiv2112.13253OpenAlexW4200628995WikidataQ113877007 ScholiaQ113877007MaRDI QIDQ2675869
Li-Gong Wang, Xiangxiang Liu, Hajo J. Broersma
Publication date: 26 September 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.13253
Related Items (4)
On the \(\alpha\)-index of minimally 2-connected graphs with given order or size ⋮ A Spectral Erdős-Sós Theorem ⋮ Spectral radius of graphs of given size with forbidden subgraphs ⋮ An \(A_{\alpha}\)-spectral Erdős-Sós theorem
Cites Work
- The Erdős-Sós conjecture for spiders of four legs
- The Erdős-Sós conjecture for spiders of large size
- 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
- Connected graphs without long paths
- The spectral radius of graphs without paths and cycles of specified length
- Spectral bounds for the clique and independence numbers of graphs
- Graphs with large maximum degree containing no odd cycles of a given length
- The spectral radius of graphs without long cycles
- A bound on the spectral radius of graphs with \(e\) edges
- Spectral extrema for graphs: the Zarankiewicz problem
- The Erdős-Sós conjecture for spiders
- A spectral condition for odd cycles in graphs
- Turán Numbers of Multiple Paths and Equibipartite Forests
- Some Inequalities for the Largest Eigenvalue of a Graph
- On maximal paths and circuits of graphs
- The spectral radius of graphs without trees of diameter at most four
This page was built for publication: On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees
