A Result on Line Graphs and Hamiltonian Graphs
S. Venu Madhava Sarma, T.Ravi Kumar, T.V.Pradeep Kumar · International Journal of Computer Applications · 2015
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.