Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{151243,
        author = {R.GEETHARAMANI and C.Vishnu Prabha},
        title = {A Study on Two Edge Disjoint Hamiltonian circuits in Vehicle Routing Problem .},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {7},
        number = {12},
        pages = {262-265},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=151243},
        abstract = {Hamiltonian graph is one of the main concepts of graph theory. There are many types of graphs in graph theory. But in this paper we discuss Hamiltonian graph and its edge disjoint Hamilton circuit. In Hamiltonian graph a path which traverse each vertices of a graph exactly once. It has been found that the intersection graph obtained from Euler graph is not a Hamiltonian graph. The graph G(3m+7,6m+14)  for m≥6 which is also planner and regular of degree 4, and non-bipartite, has two edge disjoint Hamiltonian circuit. Hamiltonian graph in this case is applied to transportation vehicle routing problem.},
        keywords = {},
        month = {},
        }