Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree

DOI10.1016/J.LAA.2020.01.021MaRDI QIDQ1987005zbMATHOpenAlexWikidataFDO

Authors Qiannan Zhou, Ligong Wang, Yong Lu

Publication date 9 April 2020

Published in Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

minimum degreesignless Laplaciansufficient conditionHamilton-connected

Mathematics Subject Classification ID

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

Abstract: In this paper, we present a spectral sufficient condition for a graph to be Hamilton-connected in terms of signless Laplacian spectral radius with large minimum degree.

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• A method in graph theory
• Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
• Graph theory
• Note on Hamilton Circuits
• On graphs with randomly deleted edges
• 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
• Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
• Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
• Spectral condition for Hamiltonicity of a graph
• Spectral radius and Hamiltonian graphs
• Spectral radius and Hamiltonian properties of graphs
• Spectral radius and Hamiltonicity of graphs
• Spectral radius and Hamiltonicity of graphs with large minimum degree.
• Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
• Sufficient spectral conditions on Hamiltonian and traceable graphs

Cited in

(11)

• An improvement of spectral conditions for Hamilton-connected graphs
• Hamilton-connectivity of line graphs with application to their detour index
• Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
• Bounds on signless Laplacian eigenvalues of Hamiltonian graphs
• Some sufficient conditions for graphs being \(k\)-leaf-connected
• Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
• On the normalized Laplacian spectral radius of traceable graphs
• Improved sufficient conditions for \(k\)-leaf-connected graphs
• Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
• The \(Q\)-index and connectivity of graphs
• An improvement of sufficient condition for \(k\)-leaf-connected graphs

This page was built for publication: Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree

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