Mathematics – Combinatorics
Scientific paper
2005-06-30
Mathematics
Combinatorics
6 pages
Scientific paper
This paper presents a solution of the polycirculant conjecture which states that every vertex-transitive graph G has an automorphism that permutes the vertices in cycles of the same length. This is done by identifying vertex-transitive graphs as coset graphs. For a coset graph H, an equivalence relation $\sim$ is defined on the vertices of cosets with classes as double cosets of the stabiliser and any other proper subgroup A' of a transitive group A of G. Induced left translations of elements of the subgroup A' are semi-regular since they preserve these double cosets and acts regularly on each of them. The coset graph is equivalent to G by a theorem of Sabidussi.
No associations
LandOfFree
A proof of the polycirculant conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A proof of the polycirculant conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A proof of the polycirculant conjecture will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-235196