A Study on Two Edge Disjoint Hamiltonian circuits in Vehicle Routing Problem .

R.GEETHARAMANI; C.Vishnu Prabha

A Study on Two Edge Disjoint Hamiltonian circuits in Vehicle Routing Problem .

Authors: R.GEETHARAMANI, C.Vishnu Prabha

Unique Paper ID: 151243
Volume: 7
Issue: 12
PageNo: 262-265

Keywords: No Keywords Found

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.

Download article

email to a friend

Cite This Article

ISSN: 2349-6002
Volume: 7
Issue: 12
PageNo: 262-265

A Study on Two Edge Disjoint Hamiltonian circuits in Vehicle Routing Problem .

Available:https://ijirt.org/Article?manuscript=151243

Impact Factor
8.01 (Year 2024)

UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.

Join Now