Sufficient spectral conditions on Hamiltonian and traceable graphs

DOI10.1016/J.LAA.2014.11.017zbMATH Open1304.05094OpenAlexW1974000684MaRDI QIDQ477765FDOQ477765

Authors 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

zbMATH Keywords

spectral radiusHamiltonian graphsignless Laplacian spectral radiustraceable graphHamiltonian bipartite graphtraceable bipartite graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45)

Abstract: In this paper, we give sufficient conditions on the spectral radius for a bipartite graph to Hamiltonian and traceable, which expand the results of Lu, Liu and Tian (2012) [10]. Furthermore, we also present tight sufficient conditions on the signless Laplacian spectral radius for a graph to Hamiltonian and traceable, which improve the results of Yu and Fan (2012) [12].

Recommendations

• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• Spectral radius and Hamiltonicity of graphs
• scientific article; zbMATH DE number 6831911
• Some generalizations of spectral conditions for \(2s\)-Hamiltonicity and \(2s\)-traceability of bipartite graphs
• Distance signless Laplacian spectral radius and Hamiltonian properties of graphs

Cites Work

• scientific article; zbMATH DE number 6119656 (Why is no real title available?)
• Graph theory
• On Hamilton's ideals
• On the first eigenvalue of bipartite graphs
• On three conjectures involving the signless Laplacian spectral radius of graphs
• Signless Laplacian spectral conditions for Hamiltonicity of graphs
• Signless Laplacian spectral radius and Hamiltonicity
• Small spectral gap in the combinatorial Laplacian implies Hamiltonian
• Spectral radius and Hamiltonian graphs
• Spectral radius and Hamiltonicity of graphs
• Towards a spectral theory of graphs based on the signless Laplacian, III

Cited In (45)

• Spectral condition for Hamiltonicity of a graph
• Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
• Spectral radius and Hamiltonicity of graphs
• Wiener-type invariants and Hamiltonian properties of graphs
• Spectral conditions for traceability of connected claw-free graphs
• Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs
• Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
• On the normalized Laplacian spectral radius of traceable graphs
• Title not available (Why is no real title available?)
• Spectral conditions and Hamiltonicity of a balanced bipartite graph with large minimum degree
• Spectral sufficient conditions on traceable graphs
• 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.
• Spectral radius and spanning trees of graphs
• Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
• Spectral sufficient conditions of the existence of the longest path in the graph and its traceability
• Title not available (Why is no real title available?)
• Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian
• Some generalizations of spectral conditions for \(2s\)-Hamiltonicity and \(2s\)-traceability of bipartite graphs
• The largest eigenvalue conditions for Hamiltonian and traceable graphs
• Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
• Bounds on signless Laplacian eigenvalues of Hamiltonian graphs
• Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
• Some spectral sufficient conditions for a graph being pancyclic
• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• Laplacian spread and some Hamiltonian properties of graphs
• Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
• Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
• Wiener index on traceable and Hamiltonian graphs
• Fractional matching number and eigenvalues of a graph
• On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs
• The spanning k-trees, perfect matchings and spectral radius of graphs
• Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
• Spectral radius and \(k\)-connectedness of a graph
• Some sufficient conditions on \(k\)-connected graphs
• Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
• On sufficient spectral radius conditions for Hamiltonicity
• An improvement of spectral conditions for Hamilton-connected graphs
• Distance spectrum, 1-factor and vertex-disjoint cycles
• Spectral radius and traceability of graphs with large minimum degree
• Title not available (Why is no real title available?)
• The spectral radius and \(k\)-power of Hamilton cycle of graphs
• The number of edges, spectral radius and Hamilton-connectedness of graphs
• The maximum size of a nonhamiltonian graph with given order and connectivity
• Spectral conditions for some graphical properties

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477765)