Spectral radius and rainbow Hamilton paths of a graph
Authors:
- Xiaocong HeXHXiaocong He
- Yongtao LiYLYongtao Li
- Lihua FengLFLihua Feng
- 18 June 2024
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (10)
Abstract
No abstract availableKeywords
Funding Information
- Natural Science Foundation of Hunan Province (2020JJ4675, 2021JJ40707)
- Fundamental Research Funds for Central Universities of the Central South University (2021zzts0034)
- National Natural Science Foundation of China (11931002, 12271527)
This publication has 23 references indexed in Scilit:
- Counting substructures and eigenvalues I: TrianglesEuropean Journal of Combinatorics, 2023
- The Maximum Spectral Radius of Graphs without Spanning Linear ForestsGraphs and Combinatorics, 2022
- The Generalized Turán Number of Spanning Linear ForestsGraphs and Combinatorics, 2022
- Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphsEuropean Journal of Combinatorics, 2021
- The shifting method and generalized Turán number of matchingsEuropean Journal of Combinatorics, 2020
- Spectral results on Hamiltonian problemDiscrete Mathematics, 2019
- Spectra of Graphs2012
- On a conjecture of V. NikiforovDiscrete Mathematics, 2009
- On the size of graphs with complete‐factorsJournal of Graph Theory, 1985
- On maximal paths and circuits of graphsActa Mathematica Hungarica, 1959