Abstract
A distance-transitive graph is a graph in which for every two ordered pairs of vertices ( u , v ) and ( u ′ , v ′ ) such that the distance between u and v is equal to the distance between u ′ and v ′ there exists an automorphism of the graph mapping u to u ′ and v to v ′ . A semiregular element of a permutation group is a non-identity element having all cycles of equal length in its cycle decomposition. It is shown that every distance-transitive graph admits a semiregular automorphism.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
