Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


11 - 14 / 14
First pagePrevious page12Next pageLast page
11.
Distance-transitive graphs admit semiregular automorphisms
Klavdija Kutnar, Primož Šparl, 2010, original scientific article

Abstract: 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.
Keywords: distance-transitive graph, vertex-transitive graph, semiregular automorphism, permutation group
Published in RUP: 15.10.2013; Views: 3282; Downloads: 98
URL Link to full text

12.
13.
Semiregular automorphisms of arc-transitive graphs
Gabriel Verret, 2013, published scientific conference contribution abstract

Keywords: automorphism group, arc-transitive graph, semiregular automorphism
Published in RUP: 15.10.2013; Views: 3177; Downloads: 71
URL Link to full text

14.
On prime-valent symmetric bicirculants and Cayley snarks
Ademir Hujdurović, Klavdija Kutnar, Dragan Marušič, 2013, published scientific conference contribution

Keywords: graph, Cayley graph, arc-transitive, snark, semiregular automorphism, bicirculant
Published in RUP: 15.10.2013; Views: 3322; Downloads: 155
URL Link to full text

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica