Spectral radius and Hamiltonian graphs
From MaRDI portal
Publication:445828
DOI10.1016/j.laa.2012.05.021zbMath1247.05129OpenAlexW1996832931MaRDI QIDQ445828
Huiqing Liu, Feng Tian, Mei Lu
Publication date: 27 August 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.05.021
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Eulerian and Hamiltonian graphs (05C45)
Related Items
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, Some spectral sufficient conditions for a graph being pancyclic, Unnamed Item, Some new sufficient conditions for 2p-Hamilton-biconnectedness of graphs, Some generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphs, Hyper-Hamiltonicity in graphs: some sufficient conditions, Spectral radius and spanning trees of graphs, Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles, On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs, Some sufficient spectral conditions on Hamilton-connected and traceable graphs, Maximum degree and minimum degree spectral radii of some graph operations, Toughness, Hamiltonicity and spectral radius in graphs, Signless Laplacian eigenvalues and circumference of graphs, Sufficient spectral conditions on Hamiltonian and traceable 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 Hamiltonian properties of graphs, Spectral radius and Hamiltonicity of graphs with large minimum degree, Energy conditions for Hamiltonicity of graphs, Fractional matching number and eigenvalues of a graph, Signless Laplacian spectral conditions for Hamiltonicity of graphs, Spectral condition for Hamiltonicity of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- A bound on the spectral radius of graphs
- A domain monotonicity theorem for graphs and Hamiltonicity
- On the spectral radius of graphs
- The largest eigenvalue of nonregular graphs
- A sharp upper bound of the spectral radius of graphs
- On the spectral radius of graphs with cut vertices
- On the spectral radius of graphs with cut edges
- Interlacing eigenvalues and graphs
- Hamilton cycles and eigenvalues of graphs
- On Hamilton's ideals
- Spectral Radius and Degree Sequence
- Matrix Analysis
- Sparse pseudo‐random graphs are Hamiltonian
- Spectral radius and Hamiltonicity of graphs
