# Show document

Title: Distance-transitive graphs admit semiregular automorphisms Kutnar, Klavdija (Author)Šparl, Primož (Author) http://dx.doi.org/10.1016/j.ejc.2009.03.018 English Not categorized 1.01 - Original Scientific Article IAM - Andrej Marušič Institute A distance-transitive graph is a graph in which for every two ordered pairs ofvertices ▫$(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 anon-identity element having all cycles of equal length in its cycle decomposition. It is shown that every distance-transitive graph admits a semiregular automorphism. distance-transitive graph, vertex-transitive graph, semiregular automorphism, permutation group 2010 str. 25-28 Vol. 31, no. 1 0195-6698 519.17 1024085332 1701 57 Document is not linked to any category.

Average score: (0 votes) Voting is allowed only to logged in users.

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.