Opis: 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.Ključne besede: distance-transitive graph, vertex-transitive graph, semiregular automorphism, permutation groupObjavljeno v RUP: 15.10.2013; Ogledov: 3371; Prenosov: 98 Povezava na celotno besedilo
Ključne besede: cubic graph, symmetric, semiregular automorphism, tetracirculant, pentacirculantObjavljeno v RUP: 15.10.2013; Ogledov: 3146; Prenosov: 95 Povezava na celotno besedilo
Ključne besede: automorphism group, arc-transitive graph, semiregular automorphismObjavljeno v RUP: 15.10.2013; Ogledov: 3268; Prenosov: 72 Povezava na celotno besedilo
Ključne besede: graph, Cayley graph, arc-transitive, snark, semiregular automorphism, bicirculantObjavljeno v RUP: 15.10.2013; Ogledov: 3415; Prenosov: 156 Povezava na celotno besedilo