1. Cyclic m-DCI-groups and m-CI-groupsIstván Kovács, Luka Šinkovec, 2025, izvirni znanstveni članek Opis: Based on the earlier work of Li from 1997 and Dobson from 2008, in this paper we complete the classification of cyclic m-DCI-groups and m-CI-groups. For a positive integer m such that m ≥ 3, we show that the group ℤ_(n) is an m-DCI-group if and only if n is not divisible by 8 nor by p² for any odd prime p < m. Furthermore, if m ≥ 6, then we show that ℤn is an m-CI-group if and only if either n ∈ {8, 9, 18}, or n ∉ {8, 9, 18} and n is not divisible by 8 nor by p² for any odd prime p < (m - 1)/2.
Ključne besede: Cayley graph, cyclic group, m-CI-group, m-DCI-group
Objavljeno v RUP: 01.04.2025; Ogledov: 210; Prenosov: 6
 Celotno besedilo (446,08 KB)
Gradivo ima več datotek! Več... |
2. Partial geometries with regular automorphism groups : master’s thesisAdisa Hodžić, 2024, magistrsko delo Ključne besede: (near-) linear space, projective plane, affine plane, partial geometry, generalized quadrangle, strongly regular graph, partial difference set, automorphism group
Objavljeno v RUP: 25.12.2024; Ogledov: 1023; Prenosov: 4
Celotno besedilo (1,22 MB) |
3. Posplošitev Lijeve domneve in popolna klasifikacija cikličnih m-(D)CI-grup : magistrsko deloLuka Šinkovec, 2023, magistrsko delo Ključne besede: (un)directed Cayley graph, cyclic group, (un)directed circulant graph, Cayley isomorphism, (un)directed CI-graph, (D)CI-group, m-(D)CI-group, key, generalised multiplier
Objavljeno v RUP: 11.09.2023; Ogledov: 1256; Prenosov: 20
Celotno besedilo (520,27 KB) |
4. |
5. The automorphism groups of non-edge transitive rose window graphsEdward 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: 1717; Prenosov: 26
Celotno besedilo (275,74 KB) |
6. |
7. |
8. |
9. |
10. |
