Spectral radius and Hamiltonicity of graphs
From MaRDI portal
Abstract: Let G be a graph of given order and mu(G) be the largest eigenvalue of its adjacency matrix. We give conditions on mu(G) that imply Hamiltonicity of G and of its complement.
Recommendations
Cites work
- A bound on the spectral radius of graphs with \(e\) edges
- A domain monotonicity theorem for graphs and Hamiltonicity
- A method in graph theory
- Hamilton cycles and eigenvalues of graphs
- Note on Hamilton Circuits
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- Sparse pseudo‐random graphs are Hamiltonian
- Spectral Radius and Degree Sequence
Cited in
(only showing first 100 items - show all)- Signless Laplacian spectral radius and Hamiltonicity
- Extremal problems on the Hamiltonicity of claw-free graphs
- Spectral radius and \(k\)-connectedness of a graph
- The number of edges, spectral radius and Hamilton-connectedness of graphs
- Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
- Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
- Spectral results on Hamiltonian problem
- Spectral conditions and Hamiltonicity of a balanced bipartite graph with large minimum degree
- Bounds on signless Laplacian eigenvalues of Hamiltonian graphs
- Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
- Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
- Spectral radius and the 2-power of Hamilton cycle
- The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
- Spectral extremal graphs for intersecting cliques
- Some spectral sufficient conditions for a graph being pancyclic
- Spectral radius and \([a,b]\)-factors in graphs
- The spectral radius of graphs with no intersecting odd cycles
- On hyper-Hamiltonicity in graphs
- On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs
- The maximum spectral radius of graphs without friendship subgraphs
- Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs
- The spectral radius of graphs with no odd wheels
- Spectral conditions for the existence of specified paths and cycles in graphs
- Some sufficient conditions on \(k\)-connected graphs
- The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- 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
- Energy conditions for Hamiltonicity of graphs
- Signless Laplacian spectral conditions for Hamiltonicity of graphs
- Complementary eigenvalues of graphs
- Hyper-Hamiltonicity in graphs: some sufficient conditions
- Recent advances on the Hamiltonian problem: survey III
- Signless Laplacian eigenvalues and circumference of graphs
- Spectral condition for Hamiltonicity of a graph
- On sufficient spectral radius conditions for Hamiltonicity
- On a conjecture of spectral extremal problems
- Maximum degree and minimum degree spectral radii of some graph operations
- Stability of Woodall's theorem and spectral conditions for large cycles
- Toughness, Hamiltonicity and spectral radius in graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree.
- Energy and the First Zagreb Index Conditions for Some Stable Properties of Graphs
- Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
- New bounds on Zagreb indices
- Some sufficient spectral conditions on Hamilton-connected and traceable graphs
- The influence of Miroslav Fiedler on spectral graph theory
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- Spectral radius and Hamiltonian graphs
- Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
- scientific article; zbMATH DE number 6949373 (Why is no real title available?)
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- Spectral radius and Hamiltonian properties of graphs
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
- Spectral conditions for traceability of connected claw-free graphs
- Laplacian spread and some Hamiltonian properties of graphs
- Some new sufficient conditions for 2p-Hamilton-biconnectedness of graphs
- Some generalizations of spectral conditions for \(2s\)-Hamiltonicity and \(2s\)-traceability of bipartite graphs
- Spectral radius and Hamiltonian properties of graphs. II
- Spectral radius and traceability of graphs with large minimum degree
- scientific article; zbMATH DE number 7090173
- Spectral conditions for some graphical properties
- Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
- scientific article; zbMATH DE number 6401583 (Why is no real title available?)
- Energy and Hamiltonicity of graphs
- An improvement of spectral conditions for Hamilton-connected graphs
- The largest eigenvalue conditions for Hamiltonian and traceable graphs
- Spectral radius and Hamiltonicity of graphs
- Spectral radius and spanning trees of graphs
- Some sufficient conditions for graphs being k-leaf-connected
- Combinations of some spectral invariants and Hamiltonian properties of graphs
- A Spectral Erdős-Sós Theorem
- Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian
- Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius
- Spectral Turán problems for intersecting even cycles
- The spectral radius and \(k\)-power of Hamilton cycle of graphs
- The \(Q\)-index and connectivity of graphs
- Spectral radius and rainbow Hamilton paths of a graph
- On the normalized Laplacian spectral radius of traceable graphs
- Toughness and spectral radius in graphs
- The \(A_{\alpha}\)-spectral radius and \([a,b]\)-factors in graphs
- Perfect integer k-matching, k-factor-critical, and the spectral radius of graphs
- The spectral even cycle problem
- A spectral condition for component factors in graphs
- Spectral radius and rainbow k-factors of graphs
- Spectral radius and the 2-power of Hamilton paths
- Spectral conditions for k-extendability and k-factors of bipartite graphs
- Principal eigenvectors in hypergraph Turán problems
- A spectral condition for Hamilton cycles in tough bipartite graphs
- Spectral radius and Hamiltonicity in split graphs
- Rainbow Hamiltonicity and the spectral radius
- Long cycles and spectral radii in planar graphs
- Eigenvalues and toughness of regular graphs
- Spectral extremal graphs for disjoint odd wheels
- The A_-spectral radius of graphs with chorded cycles
- A result on spanning trees with bounded total excess
- Toughness and signless Laplacian eigenvalues in graphs
- Spectral radius and Hamiltonicity of uniform hypergraphs
- Some conditions for pancyclicity in t-tough graphs
This page was built for publication: Spectral radius and Hamiltonicity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900619)
