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 - 10 / 24
Na začetekNa prejšnjo stran123Na naslednjo stranNa konec
1.
The automorphism groups of non-edge transitive rose window graphs
Edward Dobson, István Kovács, Štefko Miklavič, 2015, izvirni znanstveni članek

Opis: In this paper, we determine the full automorphism groups of rose window graphs that are not edge-transitive. As the full automorphism groups of edge-transitive rose window graphs have been determined, this complete the problem of calculating the full automorphism group of rose window graphs. As a corollary, we determine which rose window graphs are vertex-transitive. Finally, we determine the isomorphism classes of non-edge-transitive rose window graphs.
Ključne besede: rose window graphs, automorphism group, isomorphism problem, vertex-transitive graph
Objavljeno v RUP: 31.12.2021; Ogledov: 879; Prenosov: 18
.pdf Celotno besedilo (275,74 KB)

2.
Phd summer school in discrite mathematics
Marston D. E. Conder, Edward Dobson, Tatsuro Ito, 2013

Objavljeno v RUP: 07.11.2021; Ogledov: 597; Prenosov: 22
.pdf Celotno besedilo (9,83 MB)

3.
4.
5.
6.
Some new groups which are not CI-groups with respect to graphs
Edward Dobson, 2018, izvirni znanstveni članek

Ključne besede: Cayley graph, CI-group, isomorphism
Objavljeno v RUP: 21.02.2018; Ogledov: 2823; Prenosov: 152
URL Povezava na celotno besedilo
Gradivo ima več datotek! Več...

7.
Imprimitive permutations in primitive groups
Joao Araújo, J. P. Araújo, Peter J. Cameron, Edward Dobson, A. Hulpke, P. Lopes, 2017, izvirni znanstveni članek

Ključne besede: primitive groups, imprimitive groups, GAP, permutation type
Objavljeno v RUP: 21.02.2018; Ogledov: 2874; Prenosov: 251
URL Povezava na celotno besedilo
Gradivo ima več datotek! Več...

8.
On isomorphism and multiplier inequivalence of cyclic steiner quadruple systems
Edward Dobson, Tao Feng, Derek F. Holt, Patric R. J. Östergård, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Ključne besede: isomorphism, cyclic Steiner quadruple system, automorphism
Objavljeno v RUP: 07.02.2018; Ogledov: 2814; Prenosov: 33
URL Povezava na celotno besedilo

9.
Minimal normal subgroups of transitive permutation groups of square-free degree
Edward 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: 2340; Prenosov: 89
URL Povezava na celotno besedilo

10.
Semiregular automorphisms of vertex-transitive graphs of certain valencies
Edward Dobson, Aleksander Malnič, Dragan Marušič, 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]).
Ključne besede: mathematics, graph theory, transitive permutation group, 2-closed group, semiregular automorphism, vertex-transitive graph
Objavljeno v RUP: 03.04.2017; Ogledov: 2405; Prenosov: 83
URL Povezava na celotno besedilo

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