Hamiltonian graphs involving neighborhoo
โ
Guantao Chen; Warren E. Shreve; Bing Wei
๐
Article
๐
2006
๐
John Wiley and Sons
๐
English
โ 214 KB
## Abstract Dirac proved that a graph __G__ is hamiltonian if the minimum degree $\delta(G) \geq n/2$, where __n__ is the order of __G__. Let __G__ be a graph and $A \subseteq V(G)$. The neighborhood of __A__ is $N(A)=\{ b: ab \in E(G)$ for some $a \in A\}$. For any positive integer __k__, we show