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.
机构:
Mississippi State Univ, Dept Math & Stat, PO Drawer MA, Mississippi State, MS 39762 USA
Univ Primorska, Inst Andrej Marusic, Koper 6000, SloveniaMississippi State Univ, Dept Math & Stat, PO Drawer MA, Mississippi State, MS 39762 USA
Dobson, Edward
论文数: 引用数:
h-index:
机构:
Spiga, Pablo
Verret, Gabriel
论文数: 0引用数: 0
h-index: 0
机构:
Univ Western Australia, Sch Math & Stat, Ctr Math Symmetry & Computat, Crawley, WA 6009, Australia
Univ Primorska, FAMNIT, Koper 6000, SloveniaMississippi State Univ, Dept Math & Stat, PO Drawer MA, Mississippi State, MS 39762 USA