In 1856, Hamiltonian introduced the Hamiltonian Graph where a Graph which is covered all the vertices without repetition and end with starting vertex. In this Paper I would like to prove that If 'G' is a Complete and locally Complete graph, on n ≥ 3 vertices, which does not contain an induced K 1,3 , then G is Hamiltonian.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.