Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Spread Conditions for Some Hamiltonian Properties of a Graph

Rao Li1
1Dept. of mathematical sciences University of South Carolina Aiken Aiken, SC 29801
  • Published: 30/11/2016

Abstract

The spread of a graph \(G\) is defined as the difference between the largest and smallest eigenvalues of \(G\). Using the lower bounds obtained by Liu and Liu in [4] on the spread of a graph, we in this note present spread conditions for some Hamiltonian properties of a graph.

Keywords: spread of a graph, Hamiltonian properties
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Rao Li. Spread Conditions for Some Hamiltonian Properties of a Graph[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 099. 23-27. DOI: .