31. |
32. |
33. |
34. |
35. Odd automorphisms in vertex-transitive graphsAdemir Hujdurović, Klavdija Kutnar, Dragan Marušič, 2016, izvirni znanstveni članek Opis: An automorphism of a graph is said to be even/odd if it acts on the set of vertices as an even/odd permutation. In this article we pose the problem of determining which vertex-transitive graphs admit odd automorphisms. Partial results for certain classes of vertex-transitive graphs, in particular for Cayley graphs, are given. As a consequence, a characterization of arc-transitive circulants without odd automorphisms is obtained.
Ključne besede: graph, vertex-transitive, automorphism group, even permutation, odd permutation
Objavljeno v RUP: 15.11.2017; Ogledov: 4676; Prenosov: 106
 Celotno besedilo (281,25 KB) |
36. |
37. |
38. |
39. Minimal normal subgroups of transitive permutation groups of square-free degreeEdward Tauscher Dobson, Aleksander Malnič, Dragan Marušič, Lewis A. Nowitz, 2007, izvirni znanstveni članek Opis: 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]).
Ključne besede: mathematics, graph theory, transitive permutation group, 2-closed group, square-free degree, semiregular automorphism, vertex-transitive graph
Objavljeno v RUP: 03.04.2017; Ogledov: 5014; Prenosov: 103
 Povezava na celotno besedilo |
40. Symmetry structure of bicirculantsAleksander Malnič, Dragan Marušič, Primož Šparl, Boštjan Frelih, 2007, izvirni znanstveni članek Opis: An ▫$n$▫-bicirculant is a graph having an automorphism with two orbits of length ▫$n$▫ and no other orbits. Symmetry properties of ▫$p$▫-bicirculants, ▫$p$▫ a prime, are extensively studied. In particular, the actions of their automorphism groups are described in detail in terms of certain algebraic representation of such graphs.
Ključne besede: mathematics, graph theory, graph, circulant, bicirculant, automorphism group
Objavljeno v RUP: 03.04.2017; Ogledov: 4846; Prenosov: 107
Povezava na celotno besedilo |
