Spectral conditions and Hamiltonicity of a balanced bipartite graph with large minimum degree

DOI10.1016/j.amc.2019.03.046zbMath1428.05195OpenAlexW2935213508MaRDI QIDQ2009529

Yi Fang, Gui-Sheng Jiang, Gui-Dong Yu

Publication date: 29 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.03.046

zbMATH Keywords

Hamiltonianspectral radiusminimum degreetraceablebalanced bipartite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral radius and Hamiltonian graphs
• Sufficient spectral conditions on Hamiltonian and traceable graphs
• Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
• On the first eigenvalue of bipartite graphs
• Signless Laplacian spectral radius and Hamiltonicity
• Signless Laplacian spectral conditions for Hamiltonicity of graphs
• Spectral radius and Hamiltonicity of graphs with large minimum degree
• Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
• Spectral radius and Hamiltonian properties of graphs
• Spectral radius and traceability of connected claw-free graphs
• Spectral radius and Hamiltonicity of graphs

This page was built for publication: Spectral conditions and Hamiltonicity of a balanced bipartite graph with large minimum degree