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

被引:9
|
作者
Lanel, G. H. J. [1 ]
Pallage, H. K. [2 ]
Ratnayake, J. K. [3 ]
Thevasha, S. [4 ]
Welihinda, B. A. K. [1 ]
机构
[1] Univ Sri Jayewardenepura, Dept Math, Nugegoda 10250, Sri Lanka
[2] Univ Pittsburgh, Dept Math, Pittsburgh, PA 15260 USA
[3] Univ Colombo, Dept Math, Colombo 00700 07, Sri Lanka
[4] Clarkson Univ, Dept Math, Potsdam, NY 13699 USA
关键词
Cayley graph and digraph; vertex-transitive graph; Hamiltonian paths and cycles; ABELIAN-GROUPS; CYCLES; PATHS; ORDER; DECOMPOSITIONS; CIRCUITS;
D O I
10.1142/S1793830919300029
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Lovasz 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 vertex-transitive 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 Lovasz 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.
引用
收藏
页数:18
相关论文
共 50 条