Distance-transitive graphs admit semiregular automorphismsKutnar, Klavdija (Avtor) Šparl, Primož (Avtor) distance-transitive graphvertex-transitive graphsemiregular automorphismpermutation groupA 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.20102013-10-15 12:09:09Delo ni kategorizirano3766ISSN: 0195-6698UDK: 519.17COBISS.SI-ID: 1024085332sl