Independence Number, Neighborhood Intersection and Hamiltonian Properties

Boletim da Sociedade Paranaense de Matemática

关键词: Independence number;    Neighborhood;    Cycle.;   

DOI  :  

来源: DOAJ

【 摘 要 】

Let G be a 2-connected simple graph of order n with the independencenumber alpha. We show here that forall u; v in V(G) and any z in {u,v}, win V(G){u,v} with d(w;z)=2, if |N(u) cap N(w)| geq alpha-1 or |N(v) cap N(w)| geq alpha-1, then G is Hamiltonian, unless G belongs to a kind of special graphs.

【 授权许可】

Unknown