Distance signless Laplacian spectral radius and Hamiltonian properties of graphs

Qiannan Zhou, Ligong Wang

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Abstract

In this paper, we establish a sufficient condition on distance signless Laplacian spectral radius for a bipartite graph to be Hamiltonian. We also give two sufficient conditions on distance signless Laplacian spectral radius for a graph to be Hamilton-connected and traceable from every vertex, respectively. Furthermore, we obtain a sufficient condition for a graph to be Hamiltonian in terms of the distance signless Laplacian spectral radius of the complement of a graph G.

Original languageEnglish
Pages (from-to)2316-2323
Number of pages8
JournalLinear and Multilinear Algebra
Volume65
Issue number11
DOIs
StatePublished - 2 Nov 2017

Keywords

  • distance signless Laplacian spectral radius
  • Hamilton-connected
  • traceable from every vertex

Cite this