A Study on Two Edge Disjoint Hamiltonian circuits in Vehicle Routing Problem .
Author(s):
R.GEETHARAMANI, C.Vishnu Prabha
Keywords:
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.
Article Details
Unique Paper ID: 151243

Publication Volume & Issue: Volume 7, Issue 12

Page(s): 262 - 265
Article Preview & Download


Share This Article

Join our RMS

Conference Alert

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

Call For Paper

Volume 10 Issue 10

Last Date for paper submitting for March Issue is 25 June 2024

About Us

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org

Social Media

Google Verified Reviews