1. Nut graphs with a given automorphism groupNino Bašić, Patrick W. Fowler, 2025, original scientific article Abstract: A nut graph is a simple graph of order 2 or more for which the adjacency matrix has a single zero eigenvalue such that all nonzero kernel eigenvectors have no zero entry (i.e. are full). It is shown by construction that every finite group can be represented as the group of automorphisms of infinitely many nut graphs. It is further shown that such nut graphs exist even within the class of regular graphs; the cases where the degree is 8, 12, 16, 20 or 24 are realised explicitly.
Keywords: nut graph, graph automorphism, automorphism group, nullity, graph spectra, f-universal
Published in RUP: 25.11.2025; Views: 421; Downloads: 4
 Full text (526,71 KB)
This document has more files! More... |
2. Regular maps with primitive automorphism groupsGareth A. Jones, Martin Mačaj, 2025, original scientific article Abstract: We classify the regular maps ℳ which have automorphism groups G acting faithfully and primitively on their vertices. As a permutation group G must be of almost simple or affine type, with dihedral point stabilisers. We show that all such almost simple groups, namely all but a few groups PSL2(q), PGL2(q) and Sz(q), arise from regular maps, which are always non-orientable. In the affine case, the maps ℳ occur in orientable and non-orientable Petrie dual pairs. We give the number of maps associated with each group, together with their genus and extended type. Some of this builds on earlier work of the first author on generalised Paley maps, and on recent work of Jajcay, Li, Širáň and Wang on maps with quasiprimitive automorphism groups.
Keywords: regular map, automorphism group, primitive, almost simple, affine group
Published in RUP: 04.11.2025; Views: 295; Downloads: 2
Full text (512,34 KB) |
3. Regular and semi-regular representations of groups by posetsJonathan A. Barmak, 2025, original scientific article Abstract: By a result of Babai, with finitely many exceptions, every group G admits a semi-regular poset representation with three orbits, that is, a poset P with automorphism group Aut(P) ≃ G such that the action of Aut(P) on the underlying set is free and with three orbits. Among finite groups, only the trivial group and ℤ_2 have a regular poset representation (i.e. semi-regular with one orbit), however many infinite groups admit such a representation. In this paper we study non-necessarily finite groups which have a regular representation or a semi-regular representation with two orbits. We prove that if G admits a Cayley graph which is locally the Cayley graph of a free group, then it has a semi-regular representation of height 1 with two orbits. In this case we will see that any extension of the integers by G admits a regular representation. Applications are given to finite simple groups, hyperbolic groups, random groups and indicable groups.
Keywords: automorphism group of posets, Cayley graph, Dehn presentation, simple groups, random groups
Published in RUP: 21.10.2025; Views: 300; Downloads: 0
Full text (431,19 KB) |
4. The invariant of PGU(3,q) in the Hermitian function fieldBarbara Gatti, Francesco Ghiandoni, Gábor Korchmáros, 2025, original scientific article Abstract: Let F = F|K be a function field over an algebraically closed constant field K of positive characteristic p. For a K-automorphism group G of F, the invariant of G is the fixed field FG of G. If F has transendency degree 1 (i.e. F is the function field of an irreducible curve) and FG is rational, then each generator of FG uniquely determines FG and it makes sense to call each of them the invariant of G. In this paper, F is the Hermitian function field K(Hq)=K(x,y) with yq + y − xq + 1 = 0 and q = pr. We determine the invariant of Aut(K(Hq)) \cong PGU(3,q), and discuss some related questions on Galois subcovers of maximal curves over finite fields.
Keywords: function field, finite field, automorphism group, invariant
Published in RUP: 21.10.2025; Views: 260; Downloads: 3
Full text (388,93 KB) |
5. |
6. |
7. Partial geometries with regular automorphism groups : master’s thesisAdisa Hodžić, 2024, master's thesis Keywords: (near-) linear space, projective plane, affine plane, partial geometry, generalized quadrangle, strongly regular graph, partial difference set, automorphism group
Published in RUP: 25.12.2024; Views: 1864; Downloads: 31
Full text (1,22 MB) |
8. Linking rings structures and semisymmetric graphs : combinatorial constructionsPrimož Potočnik, Steve Wilson, 2018, original scientific article Keywords: graphs, automorphism group, symmetry, locally arc-transitive graphs, symmetric graphs, cycle structure, linking ring structure
Published in RUP: 03.01.2022; Views: 2434; Downloads: 19
Full text (397,55 KB) |
9. Semiregular automorphisms in vertex-transitive graphs with a solvable group of automorphismsDragan Marušič, 2017, original scientific article Abstract: It has been conjectured that automorphism groups of vertex-transitive (di)graphs, and more generally 2-closures of transitive permutation groups, must necessarily possess a fixed-point-free element of prime order, and thus a non-identity element with all orbits of the same length, in other words, a semiregular element. The known affirmative answers for graphs with primitive and quasiprimitive groups of automorphisms suggest that solvable groups need to be considered if one is to hope for a complete solution of this conjecture. It is the purpose of this paper to present an overview of known results and suggest possible further lines of research towards a complete solution of the problem.
Keywords: solvable group, semiregular automorphism, fixed-point-free automorphism, polycirculant conjecture
Published in RUP: 03.01.2022; Views: 2106; Downloads: 26
Full text (235,26 KB) |
10. The automorphism groups of non-edge transitive rose window graphsEdward Tauscher Dobson, István Kovács, Štefko Miklavič, 2015, original scientific article Abstract: 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.
Keywords: rose window graphs, automorphism group, isomorphism problem, vertex-transitive graph
Published in RUP: 31.12.2021; Views: 2556; Downloads: 43
Full text (275,74 KB) |
