1. Nut graphs with a prescribed number of vertex and edge orbitsNino Bašić, Ivan Damnjanović, 2026, izvirni znanstveni članek Opis: 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.
Ključne besede: nut graph, vertex orbit, edge orbit, arc orbit, Cayley graph, automorphism
Objavljeno v RUP: 09.01.2026; Ogledov: 395; Prenosov: 5
 Celotno besedilo (445,35 KB)
Gradivo ima več datotek! Več... |
2. Nut graphs with a given automorphism groupNino Bašić, Patrick W. Fowler, 2025, izvirni znanstveni članek Opis: 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.
Ključne besede: nut graph, graph automorphism, automorphism group, nullity, graph spectra, f-universal
Objavljeno v RUP: 25.11.2025; Ogledov: 653; Prenosov: 4
Celotno besedilo (526,71 KB)
Gradivo ima več datotek! Več... |
3. Colour-permuting automorphisms of complete Cayley graphsShirin Alimirzaei, Dave Witte Morris, 2025, izvirni znanstveni članek Opis: 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.
Ključne besede: Cayley graph, automorphism, colour-permuting, complete graphs
Objavljeno v RUP: 03.11.2025; Ogledov: 411; Prenosov: 2
Celotno besedilo (453,60 KB) |
4. Regular and semi-regular representations of groups by posetsJonathan A. Barmak, 2025, izvirni znanstveni članek Opis: 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.
Ključne besede: automorphism group of posets, Cayley graph, Dehn presentation, simple groups, random groups
Objavljeno v RUP: 21.10.2025; Ogledov: 500; Prenosov: 1
Celotno besedilo (431,19 KB) |
5. |
6. |
7. 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: 2114; Prenosov: 44
Celotno besedilo (1,22 MB) |
8. |
9. On colour-preserving automorphisms of Cayley graphsAdemir Hujdurović, Klavdija Kutnar, Dave Witte Morris, Joy Morris, 2016, izvirni znanstveni članek Opis: We study the automorphisms of a Cayley graph that preserve its natural edge-colouring. More precisely, we are interested in groups ▫$G$▫, such that every such automorphism of every connected Cayley graph on ▫$G$▫ has a very simple form: the composition of a left-translation and a group automorphism. We find classes of groups that have the property, and we determine the orders of all groups that do not have the property. We also have analogous results for automorphisms that permute the colours, rather than preserving them.
Ključne besede: Cayley graph, automorphism, colour-preserving, colour-permuting
Objavljeno v RUP: 03.01.2022; Ogledov: 2430; Prenosov: 40
Celotno besedilo (412,93 KB) |
10. The automorphism groups of non-edge transitive rose window graphsEdward Tauscher 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: 2885; Prenosov: 45
Celotno besedilo (275,74 KB) |
