Spectral radius and Hamiltonicity of graphs with large minimum degree

DOI10.1007/s10587-016-0301-yzbMath1413.05242arXiv1602.01033OpenAlexW2964234038MaRDI QIDQ2828825

No author found.

Publication date: 26 October 2016

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.01033

zbMATH Keywords

spectral radiusHamiltonian cycleminimum degreeHamiltonian path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (27)

Laplacian spread and some Hamiltonian properties of graphs ⋮ The largest eigenvalue conditions for Hamiltonian and traceable graphs ⋮ Some spectral sufficient conditions for a graph being pancyclic ⋮ Some new sufficient conditions for 2p-Hamilton-biconnectedness of graphs ⋮ Some generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphs ⋮ On sufficient spectral radius conditions for Hamiltonicity ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs ⋮ Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree ⋮ Spectral radius and Hamiltonian properties of graphs, II ⋮ Spectral conditions for graphs to be β-deficient involving minimum degree ⋮ 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 results on Hamiltonian problem ⋮ Spectral analogues of Erdős' theorem on Hamilton-connected graphs ⋮ Spectral conditions and Hamiltonicity of a balanced bipartite graph with large minimum degree ⋮ Spectral radius and Hamiltonicity of graphs ⋮ Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable ⋮ Spectral radius and traceability of graphs with large minimum degree ⋮ 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 ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree

Cites Work

• Unnamed Item
• Unnamed Item
• Spectral condition for Hamiltonicity of a graph
• Spectral radius and Hamiltonian graphs
• Sufficient spectral conditions on Hamiltonian and traceable graphs
• Small spectral gap in the combinatorial Laplacian implies Hamiltonian
• Arc coverings of graphs
• Hamilton connected graphs
• Signless Laplacian spectral radius and Hamiltonicity
• A method in graph theory
• A sharp upper bound of the spectral radius of graphs
• On Hamilton's ideals
• Some Inequalities for the Largest Eigenvalue of a Graph
• Sparse pseudo‐random graphs are Hamiltonian
• Spectral radius and Hamiltonian properties of graphs
• Some Theorems on Abstract Graphs
• Spectral radius and Hamiltonicity of graphs

This page was built for publication: Spectral radius and Hamiltonicity of graphs with large minimum degree