Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 7 / 7
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Classification of 2-arc-transitive dihedrants
Shao Fei Du, Aleksander Malnič, Dragan Marušič, 2008, izvirni znanstveni članek

Opis: A complete classification of 2-arc-transitive dihedrants, that is, Cayley graphs of dihedral groups is given, thus completing the study of these graphs initiated by the third author in [D. Marušič, On 2-arc-transitivity of Cayley graphs, J. Combin. Theory Ser. B 87 (2003) 162-196]. The list consists of the following graphs: (i) cycles ▫$C_{2n},\; n \ge 3$▫; (ii) complete graphs ▫$K_{2n}, \; n \ge 3$▫; (iii) complete bipartite graphs ▫$K_{n,n}, \; n \ge 3$▫; (iv) complete bipartite graphs minus a matching ▫$K_{n,n} - nK_2, \; n \ge 3$▫; (v) incidence and nonincidence graphs ▫$B(H_{11})$▫ and ▫$B'(H_{11})$▫ of the Hadamard design on 11 points; (vi) incidence and nonincidence graphs ▫$B(PG(d,q))$▫ and ▫$B'(PG(d,q))$▫, with ▫$d \ge 2$▫ and ▫$q$▫ a prime power, of projective spaces; (vii) and an infinite family of regular ▫${\mathbb{Z}}_d$▫-covers ▫$K_{q+1}^{2d}$▫ of ▫$K_{q+1, q+1} - (q+1)K_2$▫, where ▫$q \ge 3$▫ is an odd prime power and ▫$d$▫ is a divisor of ▫$\frac{q-1}{2}$▫ and ▫$q-1$▫, respectively, depending on whether ▫$q \equiv 1 \pmod{4}$▫ or ▫$q \equiv 3 \pmod{4}$▫ obtained by identifying the vertex set of the base graph with two copies of the projective line ▫$PG(1,q)$▫, where the missing matching consists of all pairs of the form ▫$[i,i']$▫, ▫$i \in PG(1,q)$▫, and the edge ▫$[i,j']$▫ carries trivial voltage if ▫$i=\infty$▫ or ▫$j=\infty$▫, and carries voltage ▫$\bar{h} \in {\mathbb{Z}}_d$▫, the residue class of ▫$h \in {\mathbb{Z}}_d$▫, if and only if ▫$i-j = \theta^h$▫, where ▫$\theta$▫ generates the multiplicative group ▫${\mathbb{F}}_q^\ast$▫ of the Galois field ▫${\mathbb{F}}_q$▫.
Najdeno v: ključnih besedah
Povzetek najdenega: ... permutation group, imprimitive group, dihedral group, Cayley graph,... ...dihedrants, that is, Cayley graphs of dihedral groups is given, thus completing the study of...
Ključne besede: permutation group, imprimitive group, dihedral group, Cayley graph, dihedrant, 2-Arc-transitive graph
Objavljeno: 15.10.2013; Ogledov: 1478; Prenosov: 32
URL Polno besedilo (0,00 KB)

2.
Distance-transitive graphs admit semiregular automorphisms
Klavdija Kutnar, Primož Šparl, 2010, izvirni znanstveni članek

Opis: 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.
Najdeno v: ključnih besedah
Povzetek najdenega: ...to ▫$v'$▫. A semiregular element of a permutation group is anon-identity element having all cycles...
Ključne besede: distance-transitive graph, vertex-transitive graph, semiregular automorphism, permutation group
Objavljeno: 15.10.2013; Ogledov: 1571; Prenosov: 38
URL Polno besedilo (0,00 KB)

3.
Minimal normal subgroups of transitive permutation groups of square-free degree
Aleksander Malnič, Dragan Marušič, Edward Dobson, 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]).
Najdeno v: ključnih besedah
Povzetek najdenega: ...It is shown that a minimal normal sub group of a transitive permutation group of square-free...
Ključne besede: mathematics, graph theory, transitive permutation group, 2-closed group, square-free degree, semiregular automorphism, vertex-transitive graph
Objavljeno: 03.04.2017; Ogledov: 787; Prenosov: 31
URL Polno besedilo (0,00 KB)

4.
Semiregular automorphisms of vertex-transitive graphs of certain valencies
Dragan Marušič, Edward Dobson, Aleksander Malnič, Lewis A. Nowitz, 2007, izvirni znanstveni članek

Opis: 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]).
Najdeno v: ključnih besedah
Povzetek najdenega: ...and, more generally, that all 2-closed transitive permutation groups contain such an element (see [D.... ...prime, admitting a transitive action of a ▫$\{2,p\}$▫- group, has a non-identity semiregular automorphism. As a...
Ključne besede: mathematics, graph theory, transitive permutation group, 2-closed group, semiregular automorphism, vertex-transitive graph
Objavljeno: 03.04.2017; Ogledov: 757; Prenosov: 27
URL Polno besedilo (0,00 KB)

5.
Multiply transitive permutation groups via the small Mathieu groups
Anna Klymenko, 2012, magistrsko delo

Najdeno v: ključnih besedah
Povzetek najdenega: ...permutation group, group action, orbit, stabilizer, multiply transitive group,...
Ključne besede: permutation group, group action, orbit, stabilizer, multiply transitive group, affine group, Mathieu group
Objavljeno: 13.11.2017; Ogledov: 314; Prenosov: 7
URL Polno besedilo (0,00 KB)

6.
Odd automorphisms in vertex-transitive graphs
Ademir Hujdurović, Klavdija Kutnar, Dragan Marušič, 2016, izvirni znanstveni članek

Opis: Avtomorfizem grafa se imenuje sod/lih, če deluje na množici vozlišč kot soda/liha permutacija. V tem članku zastavimo problem določitve tistih točkovno-tranzitivnih grafov, ki premorejo lihe avtomorfizme. Predstavimo delne rezultate za določene razrede točkovno-tranzitivnih grafov, med drugim za Cayleyjeve grafe. Kot posledico teh rezultatov dobimo karakterizacijo ločno-tranzitivnih cirkulantov brez lihih avtomorfizmov.
Najdeno v: ključnih besedah
Povzetek najdenega: ...graph, vertex-transitive, automorphism group, even permutation, odd permutation, ...
Ključne besede: graph, vertex-transitive, automorphism group, even permutation, odd permutation
Objavljeno: 15.11.2017; Ogledov: 499; Prenosov: 26
URL Polno besedilo (0,00 KB)

7.
Odd extensions of transitive groups via symmetric graphs - The cubic case
Klavdija Kutnar, Dragan Marušič, 2018, izvirni znanstveni članek

Opis: When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More precisely: when is it that the existence of automorphisms acting as even permutations on the vertex set of a graph, called even automorphisms, forces the existence of automorphisms that act as odd permutations, called odd automorphisms. As a first step towards resolving the above question, complete information on the existence of odd automorphisms in cubic symmetric graphs is given.
Najdeno v: ključnih besedah
Povzetek najdenega: ...automorphism group, arc-transitive, even permutation, odd permutation, cubic symmetric graph... ...questions is to determine their full automorphism group. In this paper this question is considered...
Ključne besede: automorphism group, arc-transitive, even permutation, odd permutation, cubic symmetric graph
Objavljeno: 19.11.2018; Ogledov: 188; Prenosov: 42
URL Polno besedilo (0,00 KB)

Iskanje izvedeno v 0 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici