 | 1 | initial version |
I was wondering if someone could help me determine whether a graph admits a semiregular automorphism, based on the following definition.
A non-identity automorphism of a graph is semiregular, in particular, (k,n)-semiregular if it has k cycles of equal length n in its cycle decomposition.
Thank you so much.
| | 2 | retagged |  |
I was wondering if someone could help me determine whether a graph admits a semiregular automorphism, based on the following definition.
A non-identity automorphism of a graph is semiregular, in particular, (k,n)-semiregular if it has k cycles of equal length n in its cycle decomposition.
Thank you so much.
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
