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 - 10 / 14
First pagePrevious page12Next pageLast page
1.
Classification of cubic vertex-transitive tricirculants
Primož Potočnik, Micael Toledo, 2020, original scientific article

Keywords: graph, cubic, semiregular automorphism, tricirculant, vertex-transitive
Published in RUP: 03.01.2022; Views: 795; Downloads: 40
.pdf Full text (1,18 MB)

2.
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: 763; Downloads: 17
.pdf Full text (235,26 KB)

3.
4.
5.
6.
Symmetric graphs: why semiregularity matters
Dragan Marušič, 2018, published scientific conference contribution abstract (invited lecture)

Keywords: vertex-transitive graph, semiregular automorphism, elusive group, solvable group
Published in RUP: 07.02.2018; Views: 1942; Downloads: 28
URL Link to full text

7.
Symmetric graphs: why semiregularity matters
Dragan Marušič, 2017, published scientific conference contribution abstract (invited lecture)

Keywords: vertex-transitive, graph, semiregular automorphism
Published in RUP: 15.11.2017; Views: 2119; Downloads: 18
URL Link to full text

8.
Minimal normal subgroups of transitive permutation groups of square-free degree
Edward Dobson, Aleksander Malnič, Dragan Marušič, Lewis A. Nowitz, 2007, original scientific article

Abstract: It is shown that a minimal normal subgroup of a transitive permutation group of square-free degree in its induced action is simple and quasiprimitive, with three exceptions related to ▫$A_5$▫, ▫$A_7$▫, and PSL(2,29). Moreover, it is shown that a minimal normal subgroup of a 2-closed permutation group of square-free degree in its induced action is simple. As an almost immediate consequence, it follows that a 2-closed transitive permutation group of square-free degree contains a semiregular element of prime order, thus giving a partial affirmative answer to the conjecture that all 2-closed transitive permutation groups contain such an element (see [D. Marušic, On vertex symmetric digraphs,Discrete Math. 36 (1981) 69-81; P.J. Cameron (Ed.), Problems from the fifteenth British combinatorial conference, Discrete Math. 167/168 (1997) 605-615]).
Keywords: mathematics, graph theory, transitive permutation group, 2-closed group, square-free degree, semiregular automorphism, vertex-transitive graph
Published in RUP: 03.04.2017; Views: 2320; Downloads: 89
URL Link to full text

9.
Semiregular automorphisms of vertex-transitive graphs of certain valencies
Edward Dobson, Aleksander Malnič, Dragan Marušič, Lewis A. Nowitz, 2007, original scientific article

Abstract: It is shown that a vertex-transitive graph of valency ▫$p+1$▫, ▫$p$▫ a prime, admitting a transitive action of a ▫$\{2,p\}$▫-group, has a non-identity semiregular automorphism. As a consequence, it is proved that a quartic vertex-transitive graph has a non-identity semiregular automorphism, thus giving a partial affirmative answer to the conjecture that all vertex-transitive graphs have such an automorphism and, more generally, that all 2-closed transitive permutation groups contain such an element (see [D. Marušic, On vertex symmetric digraphs, Discrete Math. 36 (1981) 69-81; P.J. Cameron (Ed.), Problems from the Fifteenth British Combinatorial Conference, Discrete Math. 167/168 (1997) 605-615]).
Keywords: mathematics, graph theory, transitive permutation group, 2-closed group, semiregular automorphism, vertex-transitive graph
Published in RUP: 03.04.2017; Views: 2374; Downloads: 83
URL Link to full text

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