A Hamiltonian Decomposition of Degree four Cayley Graphs on Abelian Groups

Abstract / Excerpt:

In a communications network, hamiltonian cycles are important because they provide a routing which can tolerate an edge failure. On the other hand, the problem of finding a hamiltonian cycle for a general graph is known to be NP-complete. This paper gives actual algorithms to decompose . -to two hamiltonian cycles, classes of degree four Cayley graphs on abelian groups.

Full Text
Info
Source JournalAgham Mindanao
Journal VolumeAgham Mindanao Vol. 1
AuthorsReginaldo M. Marcelo PhD
Page Count4
Place of PublicationDavao City
Original Publication DateJanuary 1, 2003
Tags
Preview

Download the PDF file .