Spectral radius conditions for the existence of all subtrees of diameter at most four
暂无分享,去创建一个
[1] Mingqing Zhai,et al. A spectral version of Mantel's theorem , 2022, Discret. Math..
[2] Wanting Sun,et al. Adjacency eigenvalues of graphs without short odd cycles , 2021, Discret. Math..
[3] Dheer Noal Desai,et al. The spectral radius of graphs with no odd wheels , 2021, Eur. J. Comb..
[4] Ming-Zhu Chen,et al. On the spectral radius of graphs without a star forest , 2021, Discret. Math..
[5] Michael Tait,et al. The Maximum Spectral Radius of Graphs Without Friendship Subgraphs , 2020, Electron. J. Comb..
[6] Mingqing Zhai,et al. Spectral extrema of graphs: Forbidden hexagon , 2020, Discret. Math..
[7] Xiao-Dong Zhang,et al. Spectral Extremal Results with Forbidding Linear Forests , 2018, Graphs Comb..
[8] Xinmin Hou,et al. The spectral radius of graphs without long cycles , 2017, Linear Algebra and its Applications.
[9] Michael Tait,et al. The Colin de Verdière parameter, excluded minors, and the spectral radius , 2017, J. Comb. Theory, Ser. A.
[10] Xinmin Hou,et al. The spectral radius of graphs without trees of diameter at most four , 2016, Linear and Multilinear Algebra.
[11] B. Wang,et al. Proof of a conjecture on the spectral radius of C4-free graphs , 2012 .
[12] Hong Liu,et al. On the Turán Number of Forests , 2012, Electron. J. Comb..
[13] László Babai,et al. Spectral Extrema for Graphs: The Zarankiewicz Problem , 2009, Electron. J. Comb..
[14] Vladimir Nikiforov,et al. The spectral radius of graphs without paths and cycles of specified length , 2009, 0903.5351.
[15] V. Nikiforov. A contribution to the Zarankiewicz problem , 2009, 0903.5350.
[16] Vladimir Nikiforov,et al. A spectral condition for odd cycles in graphs , 2007, 0707.4499.
[17] A. McLennan. The Erdős‐Sós Conjecture for trees of diameter four , 2005, J. Graph Theory.
[18] Herbert S. Wilf,et al. Spectral bounds for the clique and independence numbers of graphs , 1986, J. Comb. Theory, Ser. B.
[19] L. Lovász,et al. The Colin de Verdière parameter , 1999 .