Particular Type of Hamiltonian Graphs and their Properties
Kanak ChandraBora, Bichitra Kalita · International Journal of Computer Applications · 2014
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 non-repeated edge for simultaneous changes of m= 2n+1 for n≥0.