DSpace Repository

A survey on Hamiltonicity in Cayley graphs and digraphs on different groups

Show simple item record

dc.contributor.author Lanel, G. H. J
dc.contributor.author Pallage, H. K
dc.contributor.author Ratnayake, J.K
dc.date.accessioned 2022-02-08T04:17:07Z
dc.date.available 2022-02-08T04:17:07Z
dc.date.issued 2019
dc.identifier.citation Lanel, G. H. J, et al.(2019)."A survey on Hamiltonicity in Cayley graphs and digraphs on different groups", Discrete Mathematics, Algorithms and Applications Vol. 11, No. 5 (2019) 1930002 (18 pages) en_US
dc.identifier.uri http://dr.lib.sjp.ac.lk/handle/123456789/10148
dc.description.abstract Lov´asz had posed a question stating whether every connected, vertex-transitive graph has a Hamilton path in 1969. There is a growing interest in solving this longstanding problem and still it remains widely open. In fact, it was known that only five vertextransitive graphs exist without a Hamiltonian cycle which do not belong to Cayley graphs. A Cayley graph is the subclass of vertex-transitive graph, and in view of the Lov´asz conjecture, the attention has focused more toward the Hamiltonicity of Cayley graphs. This survey will describe the current status of the search for Hamiltonian cycles and paths in Cayley graphs and digraphs on different groups, and discuss the future direction regarding famous conjecture. en_US
dc.language.iso en en_US
dc.publisher Discrete Mathematics, Algorithms and Applications en_US
dc.subject Cayley graph and digraph; vertex-transitive graph; Hamiltonian paths and cycles en_US
dc.title A survey on Hamiltonicity in Cayley graphs and digraphs on different groups en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account