Abstract
In this paper, various properties of particular type of Hamiltonian graph and it’s edge-disjoint Hamiltonian circuits have been discussed. It has been found that the intersection graph obtained from Euler Diagram is not Hamiltonian. The graph H(3m + 7, 6m + 14) for m ≥ 1, which is planner, regular of degree four, non-bipartite but Hamiltonian graph , has perfect matching 4 with nonrepeated edge for simultaneous changes of m= 2n+1 for n≥0.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
