Lupa

Search the repository Help

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

Options:
  Reset


1 - 2 / 2
First pagePrevious page1Next pageLast page
1.
Semiregular automorphisms in vertex-transitive graphs with a solvable group of automorphisms
Dragan Marušič, 2017, original scientific article

Abstract: It has been conjectured that automorphism groups of vertex-transitive (di)graphs, and more generally 2-closures of transitive permutation groups, must necessarily possess a fixed-point-free element of prime order, and thus a non-identity element with all orbits of the same length, in other words, a semiregular element. The known affirmative answers for graphs with primitive and quasiprimitive groups of automorphisms suggest that solvable groups need to be considered if one is to hope for a complete solution of this conjecture. It is the purpose of this paper to present an overview of known results and suggest possible further lines of research towards a complete solution of the problem.
Keywords: solvable group, semiregular automorphism, fixed-point-free automorphism, polycirculant conjecture
Published in RUP: 03.01.2022; Views: 777; Downloads: 17
.pdf Full text (235,26 KB)

2.
Collisions for variants of the BLAKE hash function
Janoš Vidali, Peter Nose, Enes Pašalić, 2010, original scientific article

Keywords: BLAKE, BLOKE, BRAKE, collision, cryptography, fixed point, hash functions
Published in RUP: 15.10.2013; Views: 2951; Downloads: 64
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