Some sufficient spectral conditions on Hamilton-connected and traceable graphs

DOI10.1080/03081087.2016.1182463zbMath1356.05085OpenAlexW2348220695MaRDI QIDQ2961466

Qiannan Zhou, Li-Gong Wang

Publication date: 20 February 2017

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2016.1182463

zbMATH Keywords

spectral radiusHamilton-connectedsignless Laplacian spectral radiustraceable from every vertex

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)

Related Items (22)

Improved sufficient conditions for \(k\)-leaf-connected graphs ⋮ An improvement of spectral conditions for Hamilton-connected graphs ⋮ Hamilton-connectivity of line graphs with application to their detour index ⋮ Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications ⋮ Some generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphs ⋮ Spectral radius and spanning trees of graphs ⋮ Some sufficient conditions for graphs being \(k\)-leaf-connected ⋮ An improvement of sufficient condition for \(k\)-leaf-connected graphs ⋮ Distance signless Laplacian spectral radius and Hamiltonian properties of graphs ⋮ Toughness, Hamiltonicity and spectral radius in graphs ⋮ Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius ⋮ Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree ⋮ The number of edges, spectral radius and Hamilton-connectedness of graphs ⋮ Spectral results on Hamiltonian problem ⋮ Some sufficient conditions on \(k\)-connected graphs ⋮ Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable ⋮ Bounds on signless Laplacian eigenvalues of Hamiltonian graphs ⋮ Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs ⋮ Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius ⋮ A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree ⋮ Wiener-type invariants and Hamiltonian properties of graphs ⋮ On hyper-Zagreb index conditions for hamiltonicity of graphs

Cites Work

• Asymptotic Laplacian-energy-like invariant of lattices
• Spectral radius and Hamiltonian graphs
• Sufficient spectral conditions on Hamiltonian and traceable graphs
• Spectra of graphs
• Small spectral gap in the combinatorial Laplacian implies Hamiltonian
• Signless Laplacian spectral radius and Hamiltonicity
• A bound on the spectral radius of graphs
• Asymptotic incidence energy of lattices
• Graph Energy
• On three conjectures involving the signless Laplacian spectral radius of graphs
• Spectral radius and Hamiltonian properties of graphs
• Spectral radius and Hamiltonicity of graphs

This page was built for publication: Some sufficient spectral conditions on Hamilton-connected and traceable graphs