Hamiltonian Cycles in Cayley Graphs of Semidirect Products of Finite Groups

Simple item page
dc.contributor.authorLanel, G. H. J
dc.contributor.authorJinasena, T. M. K. K
dc.contributor.authorWelihinda, B. A. K
dc.date.accessioned2022-02-08T04:21:19Z
dc.date.available2022-02-08T04:21:19Z
dc.date.issued2020
dc.description.abstractIt has been conjectured that every connected Cayley graph of order greater than has a Hamilton cycle. In this paper, we prove that the Cayley graph of with respect to a generating set , , where with and is Hamiltonian for . Furthermore, the existence of a Hamilton cycle in the Cayley graph of a semidirect product of finite groups is proved by placing restrictions on the generating sets. Consequently, the existence of a Hamilton cycle in the Cayley graphs of several isomorphism types of groups of orders and , where is also proveden_US
dc.identifier.citationLanel, G. H. J., Jinasena, T. M. K. K. and Welihinda, B. A. K.(2020)."Hamiltonian Cycles in Cayley Graphs of Semidirect Products of Finite Groups", European Modern Studies Journal, 2020, 4(3)en_US
dc.identifier.urihttp://dr.lib.sjp.ac.lk/handle/123456789/10149
dc.language.isoenen_US
dc.publisherEuropean Modern Studies Journalen_US
dc.subjectCayley graph, connected and bridgeless, finite groups, Hamilton cycle, perfect matching, semidirect product, standard generating seten_US
dc.titleHamiltonian Cycles in Cayley Graphs of Semidirect Products of Finite Groupsen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Hamiltonian Cycles in Cayley Graphs of Semidirect Products of Finite Groups.pdf
Size:
812.9 KB
Format:
Adobe Portable Document Format
Description:
Download

License bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Information Resources