Spectral radius and traceability of connected claw-free graphs

Abstract: Let

G

be a connected claw-free graph on

n

vertices and

o v e r l i n e G

be its complement graph. Let

m u (G)

be the spectral radius of

G

. Denote by

N_{n - 3, 3}

the graph consisting of

K_{n - 3}

and three disjoint pendent edges. In this note we prove that: (1) If

m u (G) g e q n - 4

, then

G

is traceable unless

G = N_{n - 3, 3}

. (2) If

m u (o v e r l i n e G) l e q m u (o v e r l i n e N_{n - 3, 3})

and

n g e q 24

, then

G

is traceable unless

G = N_{n - 3, 3}

. Our works are counterparts on claw-free graphs of previous theorems due to Lu et al., and Fiedler and Nikiforov, respectively.

Recommendations

Cited in

(14)

This page was built for publication: Spectral radius and traceability of connected claw-free graphs