학술논문
Hamiltonicity of $k$-connected graphs with independent claws.
Document Type
Journal
Author
Shen, Ruqun (PRC-ASBJ-BP) AMS Author Profile; Tian, Feng (PRC-ASBJ-S) AMS Author Profile; Wei, Bing (PRC-ASBJ-S) AMS Author Profile
Source
Subject
05 Combinatorics -- 05C Graph theory
05C45Eulerian and Hamiltonian graphs
05C45
Language
English
Abstract
Summary: ``In this paper, we prove that if $G$ is a $k$-connected $(k\geq 2)$ graph of order $n$ such that the sum of degrees of any $k+1$ independent vertices is at least $n+k$, and if the set of claw centers of $G$ is independent, then $G$ is Hamiltonian.''