Lupa

Search the repository Help

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

Options:
  Reset


31 - 40 / 48
First pagePrevious page12345Next pageLast page
31.
Vertex-transitive odd numbers
Klavdija Kutnar, Ademir Hujdurović, Dragan Marušič, 2017, published scientific conference contribution abstract (invited lecture)

Keywords: odd automorphism, even-closed, vertex-transitive, graph
Published in RUP: 15.11.2017; Views: 1821; Downloads: 25
URL Link to full text

32.
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: 2440; Downloads: 89
URL Link to full text

33.
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: 2494; Downloads: 83
URL Link to full text

34.
35.
Symmetry of graphs via even/odd automorphisms
Dragan Marušič, Klavdija Kutnar, 2016, published scientific conference contribution abstract (invited lecture)

Keywords: vertex-transitive, graph, odd automorphism, automorphism group
Published in RUP: 08.08.2016; Views: 2201; Downloads: 27
URL Link to full text

36.
Odd automorphism in vertex-transitive graphs
Klavdija Kutnar, Ademir Hujdurović, Dragan Marušič, 2016, published scientific conference contribution abstract

Keywords: vertex-transitive, graph, odd automorphism, even-closed
Published in RUP: 08.08.2016; Views: 2497; Downloads: 15
URL Link to full text

37.
Vertex-transitive graphs : why semiregularity matters
Dragan Marušič, 2016, published scientific conference contribution abstract (invited lecture)

Keywords: vertex-transitive, graph, semiregular
Published in RUP: 08.08.2016; Views: 2384; Downloads: 29
URL Link to full text

38.
39.
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: 3408; Downloads: 98
URL Link to full text

40.
On cubic non-Cayley vertex-transitive graphs
Klavdija Kutnar, Dragan Marušič, Cui Zhang, 2012, original scientific article

Keywords: vertex-transitive graph, non-Cayley graph, automorphism group
Published in RUP: 15.10.2013; Views: 2962; Downloads: 129
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