Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Physical Sciences and Mathematics
Sufficient Condition For Complete Graphs And Hamiltonian Graphs, Innovative Research Publications Irp India, S.Venu Madava Sarma, T.V. Pradeep Kumar
Sufficient Condition For Complete Graphs And Hamiltonian Graphs, Innovative Research Publications Irp India, S.Venu Madava Sarma, T.V. Pradeep Kumar
Innovative Research Publications IRP India
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 every Complete Graph ‘G’ having n ≥ 5 vertices, such that n is odd. If for all pairs of nonadjacent vertices u, v one has du + dv ≥ n − 2, then G has a Hamiltonian path.