1. Normality of quartic cayley graphs on regular ▫$p$▫-groups : a CFSG-free approachKlavdija Kutnar, Aleksander Malnič, Dragan Marušič, 2026, original scientific article Abstract: Relying on the Classification of Finite Simple Groups it was shown by Feng and Xu (Discrete Math., 2005) that every quartic Cayley graph of a regular $p$-group, $p \neq 2,5$, is normal. In this paper a CFSG-free proof of a special case of Feng-Xu theorem is given. Along the way it is also proved that for an arbitrary $p$-group $G$ with a minimum set $\{a,b\}$ of two generators, one of which is of order $p$, in the corresponding Cayley graph $\mathrm{Cay}(G,\{a,a^{-1},b,b^{-1}\})$ the induced action of vertex stabilizer on the neighbors' set is contained in the dihedral group $D_8$. Keywords: classification of finite simple groups, regular p-group, p-groups of exponent p, Cayley graph, normal graph, automorphism group Published in RUP: 23.09.2026; Views: 247; Downloads: 5
Full text (612,50 KB) This document has more files! More... |
2. Classification of pentavalent symmetric tricirculantsYasamin Khaefi, Klavdija Kutnar, Dragan Marušič, 2026, original scientific article Abstract: A graph $\Gamma$ is said to be an {\em $m$-Cayley graph} on a group $G$ ($|G|\ne 1$) if its automorphism group contains a semiregular subgroup isomorphic to $G$ having $m$ orbits on the vertex set of $\Gamma$. If $G$ is cyclic and $m=3$ then $\Gamma$ is called a {\em tricirculant}. A graph is said to be {\em symmetric} if its automorphism group acts transitively on the set of its arcs. In this paper, it is shown that with the exception of $K_6$, no connected pentavalent symmetric tricirculant exists. Keywords: pentavalent graph, symmetric, semiregular automorphism, tricirculant Published in RUP: 22.06.2026; Views: 692; Downloads: 11
Full text (425,21 KB) This document has more files! More... |
3. Nut graphs with a prescribed number of vertex and edge orbitsNino Bašić, Ivan Damnjanović, 2026, original scientific article Abstract: A nut graph is a nontrivial graph whose adjacency matrix has a one-dimensional null space spanned by a vector without zero entries. Recently, it was shown that a nut graph has more edge orbits than vertex orbits. It was also shown that for any even $r \geq 2$ and any $k \geq r + 1$, there exist infinitely many nut graphs with r vertex orbits and k edge orbits. Here, we extend this result by finding all the pairs $(r, k)$ for which there exists a nut graph with $r$ vertex orbits and $k$ edge orbits. In particular, we show that for any $k \geq 2$, there are infinitely many Cayley nut graphs with $k$ edge orbits and $k$ arc orbits. Keywords: nut graph, vertex orbit, edge orbit, arc orbit, Cayley graph, automorphism Published in RUP: 09.01.2026; Views: 1110; Downloads: 8
Full text (445,35 KB) This document has more files! More... |
4. 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: 1377; Downloads: 6
Full text (526,71 KB) This document has more files! More... |
5. Colour-permuting automorphisms of complete Cayley graphsShirin Alimirzaei, Dave Witte Morris, 2025, original scientific article Abstract: Let G be a (finite or infinite) group, and let KG = Cay(G; G \ {1}) be the complete graph with vertex set G, considered as a Cayley graph of G. Being a Cayley graph, it has a natural edge-colouring by sets of the form {s, s-1} for s in G. We prove that every colour-permuting automorphism of KG is an affine map, unless G is isomoprhic to the direct product of Q8 and B, where Q8 is the quaternion group of order 8, and B is an abelian group, such that b2 is trivial for all b in B.
We also prove (without any restriction on G) that every colour-permuting automorphism of KG is the composition of a group automorphism and a colour-preserving graph automorphism. This was conjectured by D. P. Byrne, M. J. Donner, and T. Q. Sibley in 2013. Keywords: Cayley graph, automorphism, colour-permuting, complete graphs Published in RUP: 03.11.2025; Views: 900; Downloads: 11
Full text (453,60 KB) |
6. 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: 1138; Downloads: 10
Full text (431,19 KB) |
7. |
8. |
9. 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: 2831; Downloads: 70
Full text (1,22 MB) |
10. |