Abstract
We partly confirm a Brualdi-Solheid-Tur\'{a}n type conjecture due to Nikiforov, which is a spectral radius analogue of the well-known Erd\H{o}s-S\'os Conjecture that any tree of order $t$ is contained in a graph of average degree greater than $t-2$. We confirm Nikiforov's Conjecture for all brooms and for a larger class of spiders. For our proofs we also obtain a new Tur\'{a}n type result which might turn out to be of independent interest.
| Original language | English |
|---|---|
| Publisher | ArXiv.org |
| DOIs | |
| Publication status | Published - 25 Dec 2021 |
Keywords
- math.CO
Fingerprint
Dive into the research topics of 'On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees'. Together they form a unique fingerprint.Research output
- 1 Article
-
On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees
Liu, X., Broersma, H. & Wang, L., Dec 2022, In: Discrete mathematics. 345, 12, 113112.Research output: Contribution to journal › Article › Academic › peer-review
Open AccessFile6 Link opens in a new tab Citations (Scopus)199 Downloads (Pure)
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver