Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
type: Item
instance of: scholarly article
title: Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
zbMATH Open document ID: 1391.05161
DOI: 10.1080/03081087.2017.1331994
author: Xiaodan Chen
author: Yaoping Hou
author: Jianguo Qian
published in: Linear and Multilinear Algebra
publication date: 2018-05-28T00:00:00Z
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 6875486
zbMATH Keywords: Hamiltonian graph
zbMATH Keywords: sufficient condition
zbMATH Keywords: number of edges
zbMATH Keywords: spectral radius
zbMATH Keywords: signless Laplacian
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1080/03081087.2017.1331994
OpenAlex ID: W2962744814
cites work: Q5422499
cites work: Recent advances on the Hamiltonian problem: survey III
cites work: Arc coverings of graphs
cites work: Variations on the Hamiltonian Theme
cites work: Spectral radius and Hamiltonian properties of graphs
cites work: Spectral radius and Hamiltonicity of graphs
cites work: Spectral condition for Hamiltonicity of a graph
cites work: Signless Laplacian spectral radius and Hamiltonicity
cites work: Some new results in extremal graph theory
cites work: Sufficient spectral conditions on Hamiltonian and traceable graphs
cites work: Spectral radius and Hamiltonicity of graphs with large minimum degree
cites work: Spectral radius and Hamiltonian graphs
cites work: Small spectral gap in the combinatorial Laplacian implies Hamiltonian
cites work: Sparse pseudo‐random graphs are Hamiltonian
cites work: Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
cites work: Spectral radius and traceability of connected claw-free graphs
cites work: Some sufficient spectral conditions on Hamilton-connected and traceable graphs
cites work: Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
cites work: On Hamilton's ideals
cites work: Hamilton connected graphs
cites work: A method in graph theory
cites work: Some Inequalities for the Largest Eigenvalue of a Graph
cites work: A sharp upper bound of the spectral radius of graphs
cites work: Maximizing the sum of the squares of the degrees of a graph
cites work: On three conjectures involving the signless Laplacian spectral radius of graphs
cites work: Q3642517
description: scientific article; zbMATH DE number 6875486