On edge-Hamiltonian property of Cayley g
โ
C.C. Chen
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 368 KB
Let G be a group generated by X. A Cayley graph ouer G is defined as a graph G(X) whose vertex set is G and whose edge set consists of all unordered pairs [a, b] with a, b E G and am'b E X U X-', where X-t denotes the set (x-t ( .x E X}. When X is a minimal generating set or each element of X is of