Sufficient spectral conditions on Hamiltonian and traceable graphs

From MaRDI portal
Publication:477765

DOI10.1016/j.laa.2014.11.017zbMath1304.05094arXiv1412.5273OpenAlexW1974000684MaRDI QIDQ477765

Yong-Cai Geng, Sumit K. Garg

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




Related Items (38)

Spectral conditions for traceability of connected claw-free graphsLaplacian spread and some Hamiltonian properties of graphsAn improvement of spectral conditions for Hamilton-connected graphsThe spanning k-trees, perfect matchings and spectral radius of graphsThe largest eigenvalue conditions for Hamiltonian and traceable graphsSome spectral sufficient conditions for a graph being pancyclicUnnamed ItemSome generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphsOn sufficient spectral radius conditions for HamiltonicitySpectral radius and spanning trees of graphsSpectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cyclesSufficient spectral conditions for graphs being k-edge-Hamiltonian or k-HamiltonianOn sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphsSome sufficient spectral conditions on Hamilton-connected and traceable graphsDistance signless Laplacian spectral radius and Hamiltonian properties of graphsWIENER INDEX ON TRACEABLE AND HAMILTONIAN GRAPHSUnified spectral Hamiltonian results of balanced bipartite graphs and complementary graphsSpectral conditions for graphs to be β-deficient involving minimum degreeSpectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphsSpectral radius and \(k\)-connectedness of a graphSufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radiusSignless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degreeThe number of edges, spectral radius and Hamilton-connectedness of graphsSpectral conditions for some graphical propertiesSpectral conditions and Hamiltonicity of a balanced bipartite graph with large minimum degreeSpectral radius and Hamiltonicity of graphsSome sufficient conditions on \(k\)-connected graphsSpectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverableBounds on signless Laplacian eigenvalues of Hamiltonian graphsSufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphsSufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radiusA sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degreeSpectral radius and Hamiltonicity of graphs with large minimum degreeFractional matching number and eigenvalues of a graphDistance spectrum, 1-factor and vertex-disjoint cyclesThe maximum size of a nonhamiltonian graph with given order and connectivityWiener-type invariants and Hamiltonian properties of graphsSpectral condition for Hamiltonicity of a graph



Cites Work


This page was built for publication: Sufficient spectral conditions on Hamiltonian and traceable graphs