A330697 Numbers k such that every vertex-transitive graph of order k is a Cayley-graph.

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 17, 19, 21, 22, 23, 25, 27, 29, 31, 33, 37, 38, 39, 41, 43, 46, 47, 49, 53, 55, 59, 61, 62, 67, 69, 71, 73, 79, 83, 86, 87, 89, 93, 94, 95, 97, 101, 103, 107, 109, 113, 115, 118, 121, 123, 125, 127, 129, 131, 133, 134, 137, 139

Offset: 1

Author

M. Farrokhi D. G., Dec 26 2019

Keywords

• nonn

Comments

Numbers k for which A185959(k) = A006799(k).

Numbers k for which A006792(k) = 0.

In the Farrokhi reference, a Cayley number is a number k such that all vertex transitive graphs of order k are Cayley graphs.

Links

• M. Farrokhi D. G., List of known Cayley numbers less than or equal to 1000000
• M. Farrokhi D. G., Cayley numbers
• M. Farrokhi D. G., Cayley numbers (GitHub)

Crossrefs

Cf. A006792, A006799, A185959, A330698.

Programs

GAP

# See M. Farrokhi Github repository for a GAP program.