• A NEW CONDITION FOR A GRAPH TO BE HAMILTONIAN

Abstract

A cycle passing through all the vertices of a graph is called Hamiltonian cycle. A graph containing Hamiltonian cycle is called Hamiltonian graph. In this paper I represent a new condition for a graph to be Hamiltonian in particular I prove that every simple closed graph G of n vertices is Hamiltonian if degree of (n-1) vertices is exactly equal to three i.e. = 3 and the degree of remaining one vertex is exactly equal to n-1 =n-1.