Hamiltonian Decomposition of Special Class of Ladder Graphs

L.T. Cherin Monish Femila¹ , S. Asha²

Section:Research Paper, Product Type: Isroset-Journal
Vol.5 , Issue.5 , pp.114-120, Oct-2018

CrossRef-DOI:   https://doi.org/10.26438/ijsrmss/v5i5.114120

Online published on Oct 31, 2018

Copyright © L.T. Cherin Monish Femila , S. Asha . This 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.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

745 Views    269 Downloads    93 Downloads

Abstract :
A path in a graph G that contains every vertex of G is called Hamiltonian path. A cycle in a graph G that contains every vertex of G is called a Hamiltonian cycle of G. A Hamiltonian graph is a graph that contains a Hamiltonian cycle. A graph is uniquely Hamiltonian if it contains exactly one Hamiltonian cycle. A decomposition of a graph G into Hamiltonian cycles will be called Hamiltonian decomposition of G. In this paper, we decompose some families of graphs such as ladder, triangular ladder, diagonal ladder, and circular ladder using the concept of Hamiltonian decomposition. Also using the concept of Hamiltonian decomposition of ladder graphs we decompose the diagonal ladder graph.

Key-Words / Index Term :
Hamiltonian cycle, Hamiltonian graph, uniquely Hamiltonian, Hamiltonian decomposition, Ladder Graph.

References :
[1] Klas Markstrom, “Even cycle decomposition of 4-regular graphs and line graphs”.
[2] Murugesan N., Vanadhi T., “Hamiltonian decomposition of complete graphs and complete digraphs”, Global Journal of theoretical and applied Mathematics Sciences, Vol 1, No 1, (2011), ISSN 2248-9916.
[3] Bermond J.C., “ Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs”, Advances in Graph Theory, Annals of Discrete Mathematics 3 (1978) 21-28.
[4] Bondy J.A., Murty U.S.R., “Graph Theory with Applications”, 1976, Elsevier, New York.
[5] Bosak J., “Decompositions of Graphs”, 1990, Kluwer Academic Press, Dordrecht.
[6] Seoud. M.A., Shakir M. Salman, “On Difference Cordial Graphs”, Mathematica Aeterna, Vol. 5, 2015, no. 1, 105 – 124.