1. Automorphisms and quotients of 2-colored quasi best match graphsAnnachiara Korchmaros, 2026, original scientific article Abstract: 2-colored quasi best match graphs (2-qBMGs) are directed graphs that arose in evolution theory. Investigations of 2-qBMGs have mostly focused on computational issues. However, 2-qBMGs also have relevant properties for structural graph theory; in particular, their undirected underlying graph is free from induced paths and cycles of size at least 6. In this paper, results on the structure of the automorphism groups of 2-qBMGs are obtained, which shows how to construct 2-qBMGs with large automorphism groups.
Keywords: group of automorphisms, bipartite graphs, phylogenetics
Published in RUP: 05.01.2026; Views: 177; Downloads: 1
 Full text (498,12 KB) |
2. Platonic configurations of points and linesJurij Kovič, Aleksander Simonič, 2026, original scientific article Abstract: We present some methods for constructing connected spatial geometric configurations (p_q, n_k) of points and lines, preserved by the same isometries of Euclidean space E³ as the predetermined Platonic solid. In this paper, we are mainly interested in configurations (n₃), (n₄), and (n₅), but also in unbalanced configurations (p₃, n₄), (p₃, n₅), and (p₄, n₅).
Keywords: configuration of points and lines, symmetry group, Platonic solid, centrally symmetric solid, projection from a point
Published in RUP: 22.12.2025; Views: 123; Downloads: 1
Full text (533,56 KB) |
3. 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: 427; Downloads: 4
Full text (526,71 KB)
This document has more files! More... |
4. A unified Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groupsJ. Pascal Gollin, Kevin Hendrey, O-joung Kwon, Sang-il Oum, Youngho Yoo, 2025, original scientific article Abstract: In 1965, Erdős and Pósa proved that there is an (approximate) duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does not hold for odd cycles, and Dejter and Neumann-Lara asked in 1988 to find all pairs (l, z) of integers where such a duality holds for the family of cycles of length l modulo z. We characterise all such pairs, and we further generalise this characterisation to cycles in graphs labelled with a bounded number of abelian groups, whose values avoid a bounded number of elements of each group. This unifies almost all known types of cycles that admit such a duality, and it also provides new results. Moreover, we characterise the obstructions to such a duality in this setting, and thereby obtain an analogous characterisation for cycles in graphs embeddable on a fixed compact orientable surface.
Keywords: Erdős-Pósa property, cycle packing, group-labelled graph
Published in RUP: 17.11.2025; Views: 338; Downloads: 8
Full text (1,17 MB)
This document has more files! More... |
5. 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: 299; Downloads: 2
Full text (512,34 KB) |
6. Transitive regular q-analogs of graphsDean Crnković, Vedrana Mikulić Crnković, Andrea Švob, Matea Zubović Žutolija, 2025, original scientific article Abstract: In 1976, Delsarte introduced the notion of q-analogs of designs, and q-analogs of graphs were introduced recently by M. Braun et al. In this paper, we extend that study by giving a method for constructing transitive regular q-analogs of graphs. Further, we illustrate the method by giving some examples. Additionally, we introduced the notion of q-analogs of quasi-strongly regular graphs and give examples of transitive q-analogs of quasi-strongly regular graphs coming from spreads.
Keywords: q-ary design, q-ary graph, regular graph, transitive group
Published in RUP: 03.11.2025; Views: 225; Downloads: 1
Full text (382,29 KB) |
7. Bounding s for vertex-primitive s-arc-transitive digraphs of alternating and symmetric groupsJunyan Chen, Lei Chen, Michael Giudici, Jing Jian Li, Cheryl E. Praeger, Binzhou Xia, 2025, original scientific article Abstract: Determining an upper bound on s for finite vertex-primitive s-arc-transitive digraphs has received considerable attention dating back to a question of Praeger in 1990. It was shown by Giudici and Xia that the smallest upper bound on s is attained for some digraph admitting an almost simple s-arc-transitive group. In this paper, based on the work of Pan, Wu and Yin, we prove that s<=2 in the case where the group is an alternating or symmetric group.
Keywords: digraph, vertex-primitive, s-arc-transitive, alternating group, symmetric group
Published in RUP: 22.10.2025; Views: 290; Downloads: 1
Full text (397,42 KB) |
8. Families of association schemes on triples from two-transitive groupsJose Maria P. Balmaceda, Dom Vito A. Briones, 2025, original scientific article Abstract: Association schemes on triples (ASTs) are ternary analogues of classical association schemes. Similar to how Schurian association schemes arise from transitive groups, ASTs arise from two-transitive groups. In this paper, we obtain the third valencies and the number of relations of the ASTs obtained from two-transitive permutation groups. Further, we obtain the intersection numbers of the ASTs produced by PΓL(k, n), PSL(2, n), AΓL(k, n), and the sporadic two-transitive groups. In particular, the ASTs from the actions of PΓL(k, n), PSL(2, n), and the sporadic groups are commutative.
Keywords: association scheme on triples, permutation group, ternary algebra, algebraic combinatorics
Published in RUP: 21.10.2025; Views: 337; Downloads: 7
Full text (417,07 KB) |
9. Minimal directed strongly regular Cayley graphs over generalized dicyclic groupsYueli Han, Lu Lu, 2025, original scientific article Abstract: Let G be a group with identity element 1, and let S be a subset of G \ {1}. The subset S is called minimal if ⟨S⟩ = G and there exists an element s ∈ S such that ⟨S \ {s, s−1}⟩ ≠ G. In this paper, we completely determine all directed strongly regular Cayley graphs Cay(G, S) for any generalized dicyclic group G, provided that S is a minimal subset of G.
Keywords: directed strongly regular graph, Cayley graph, generalized dicyclic group
Published in RUP: 21.10.2025; Views: 330; Downloads: 2
Full text (385,94 KB) |
10. 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: 308; Downloads: 0
Full text (431,19 KB) |
