Spectral radius and Hamiltonicity in generalized split graphs
Authors:
- Xinxuan ChenXCXinxuan Chen
- Xianya GengXGXianya Geng
- Shuchao LiSLShuchao Li
- Yuantian YuYYYuantian Yu
- 25 September 2026
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 350 (2)
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (12571365)
- National Natural Science Foundation of China (12171190)
This publication has 33 references indexed in Scilit:
- Path factors in bipartite graphs from size or spectral radiusAequationes mathematicae, 2024
- On hamiltonian line graphs of hypergraphsJournal of Graph Theory, 2022
- Recent Advances on the Hamiltonian Problem: Survey IIIGraphs and Combinatorics, 2013
- Hamiltonian cycles in Dirac graphsCombinatorica, 2009
- 2-factors in triangle-free graphsJournal of Graph Theory, 1996
- An algorithm for finding hamilton paths and cycles in random graphsCombinatorica, 1987
- Toughness and the existence of k‐factorsJournal of Graph Theory, 1985
- Hamiltonian results in K1,3‐free graphsJournal of Graph Theory, 1984
- Tough graphs and hamiltonian circuitsDiscrete Mathematics, 1973
- A note on Hamiltonian circuitsDiscrete Mathematics, 1972