Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4649310 | Discrete Mathematics | 2009 | 9 Pages |
Abstract
An automorphism of an undirected simple graph is called a shift if it maps every vertex to an adjacent one. For all finite groups G, we determine the minimum nonzero valency of a Cayley graph on G that does not admit a shift. We also get a classification of groups with all involutions central and such that for every pair a,b of elements of the group, one of ab=ba, abaâ1=bâ1, babâ1=aâ1 or a2=b±2 holds.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gabriel Verret,