Sufficient spectral conditions on Hamiltonian and traceable graphs
From MaRDI portal
Publication:477765
DOI10.1016/j.laa.2014.11.017zbMath1304.05094arXiv1412.5273OpenAlexW1974000684MaRDI QIDQ477765
Publication date: 9 December 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5273
spectral radiusHamiltonian graphsignless Laplacian spectral radiustraceable graphHamiltonian bipartite graphtraceable bipartite graph
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45)
Related Items (38)
Spectral conditions for traceability of connected claw-free graphs ⋮ Laplacian spread and some Hamiltonian properties of graphs ⋮ An improvement of spectral conditions for Hamilton-connected graphs ⋮ The spanning k-trees, perfect matchings and spectral radius of graphs ⋮ The largest eigenvalue conditions for Hamiltonian and traceable graphs ⋮ Some spectral sufficient conditions for a graph being pancyclic ⋮ Unnamed Item ⋮ Some generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphs ⋮ On sufficient spectral radius conditions for Hamiltonicity ⋮ Spectral radius and spanning trees of graphs ⋮ Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs ⋮ Some sufficient spectral conditions on Hamilton-connected and traceable graphs ⋮ Distance signless Laplacian spectral radius and Hamiltonian properties of graphs ⋮ WIENER INDEX ON TRACEABLE AND HAMILTONIAN GRAPHS ⋮ Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs ⋮ Spectral conditions for graphs to be β-deficient involving minimum degree ⋮ Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs ⋮ Spectral radius and \(k\)-connectedness of a graph ⋮ 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 conditions for some graphical properties ⋮ Spectral conditions and Hamiltonicity of a balanced bipartite graph with large minimum degree ⋮ Spectral radius and Hamiltonicity of graphs ⋮ 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 ⋮ Spectral radius and Hamiltonicity of graphs with large minimum degree ⋮ Fractional matching number and eigenvalues of a graph ⋮ Distance spectrum, 1-factor and vertex-disjoint cycles ⋮ The maximum size of a nonhamiltonian graph with given order and connectivity ⋮ Wiener-type invariants and Hamiltonian properties of graphs ⋮ Spectral condition for Hamiltonicity of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Spectral radius and Hamiltonian graphs
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- On the first eigenvalue of bipartite graphs
- Signless Laplacian spectral radius and Hamiltonicity
- Signless Laplacian spectral conditions for Hamiltonicity of graphs
- On Hamilton's ideals
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Spectral radius and Hamiltonicity of graphs
This page was built for publication: Sufficient spectral conditions on Hamiltonian and traceable graphs