paper

Spectral radius and traceability of connected claw-free graphs

arXiv:1406.5404 · doi:10.2298/FIL1609445N

Abstract

Let be a connected claw-free graph on vertices and be its complement graph. Let be the spectral radius of . Denote by the graph consisting of and three disjoint pendent edges. In this note we prove that: (1) If , then is traceable unless . (2) If and , then is traceable unless . Our works are counterparts on claw-free graphs of previous theorems due to Lu et al., and Fiedler and Nikiforov, respectively.

arXiv comment12 pages,3 figures,to appear in FLOMAT

References in corpus (3)

Cited by in corpus (4)