Spectral radius and Hamiltonian graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- A bound on the spectral radius of graphs
- A domain monotonicity theorem for graphs and Hamiltonicity
- A sharp upper bound of the spectral radius of graphs
- Graph theory
- Hamilton cycles and eigenvalues of graphs
- Interlacing eigenvalues and graphs
- Matrix Analysis
- On Hamilton's ideals
- On the spectral radius of graphs
- On the spectral radius of graphs with cut edges
- On the spectral radius of graphs with cut vertices
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- Sparse pseudo‐random graphs are Hamiltonian
- Spectral Radius and Degree Sequence
- Spectral radius and Hamiltonicity of graphs
- The largest eigenvalue of nonregular graphs
Cited in
(42)- Signless Laplacian spectral conditions for Hamiltonicity of graphs
- Hyper-Hamiltonicity in graphs: some sufficient conditions
- An improvement of spectral conditions for Hamilton-connected graphs
- The number of edges, spectral radius and Hamilton-connectedness of graphs
- Spectral radius and \(k\)-connectedness of a graph
- Spectral condition for Hamiltonicity of a graph
- Spectral conditions for traceability of connected claw-free graphs
- Bounds on signless Laplacian eigenvalues of Hamiltonian graphs
- Toughness, Hamiltonicity and spectral radius in graphs
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
- Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
- Energy conditions for Hamiltonicity of graphs
- On the normalized Laplacian spectral radius of traceable graphs
- Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs
- Spectral radius and Hamiltonicity of graphs
- Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
- Spectral radius and Hamiltonian properties of graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree.
- Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
- On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs
- The spectral radius and \(k\)-power of Hamilton cycle of graphs
- Combinations of some spectral invariants and Hamiltonian properties of graphs
- Signless Laplacian eigenvalues and circumference of graphs
- Laplacian spread and some Hamiltonian properties of graphs
- Spectral radius and spanning trees of graphs
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- Some generalizations of spectral conditions for \(2s\)-Hamiltonicity and \(2s\)-traceability of bipartite graphs
- Some sufficient conditions on \(k\)-connected graphs
- A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
- Maximum degree and minimum degree spectral radii of some graph operations
- scientific article; zbMATH DE number 6949373 (Why is no real title available?)
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
- The \(Q\)-index and connectivity of graphs
- Spectral conditions for some graphical properties
- Fractional matching number and eigenvalues of a graph
- Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
- Some sufficient spectral conditions on Hamilton-connected and traceable graphs
- Some spectral sufficient conditions for a graph being pancyclic
- Spectral conditions and Hamiltonicity of a balanced bipartite graph with large minimum degree
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- Some new sufficient conditions for 2p-Hamilton-biconnectedness of graphs
This page was built for publication: Spectral radius and Hamiltonian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q445828)
