IJPAM: Volume 34, No. 4 (2007)

NEIGHBORHOOD CONDITIONS FOR BALANCED
BIPARTITE GRAPHS TO BE HAMILTONIAN

Daniel Brito$^1$, Gladys Lárez$^2$
$^{1,2}$Departamento de Matemáticas
Universidad de Oriente
Apartado 245, Cumaná 6101-A, VENEZUELA
$^1$e-mail: dbrito@sucre.udo.edu.ve
$^2$e-mail: glarez@sucre.udo.edu.ve


Abstract.Let $G$ be a balanced bipartite graph of order $2n$ and minimum degree $\delta (G) \geq 4$. If for every balanced independent set $S$ of four vertices $\vert N(S)\vert> n $, then $G$ is Hamiltonian.

Received: October 19, 2006

AMS Subject Classification: 05C38, 05C45, 05C70

Key Words and Phrases: Hamiltonian, neighborhood union, bipartite graph

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2007
Volume: 34
Issue: 4