Relation Between Complete Graph And Its Closure Of A Graph

Authors

  • S Venu Madava Sarma

DOI:

https://doi.org/10.15520/ajcem.2014.vol3.iss6.15.pp79-81.

Abstract

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’ is Hamiltonian then its Closure of Graph is also Hamiltonian.

 

Key words : Graph, Euler Graph, Hamiltonian graph, Complete Graph, Closure of a Graph.

Author Biography

S Venu Madava Sarma

Assistant Professor of Mathematics, K. L. University, Vaddeswaram, Guntur District, Andhra Pradesh, India

Downloads

Published

2015-01-07

How to Cite

Sarma, S. V. M. (2015). Relation Between Complete Graph And Its Closure Of A Graph. Asian Journal of Current Engineering and Maths, 3(6), 79–81. https://doi.org/10.15520/ajcem.2014.vol3.iss6.15.pp79-81.

Issue

Asian Journal of Current Engineering and Maths

Section

Mathematics

License

COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY

 

All paper submissions must carry the following duly signed by all the authors:

“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.”