1. On cubic polycirculant nut graphsNino Bašić, Ivan Damnjanović, 2025, izvirni znanstveni članek Opis: A nut graph is a nontrivial simple graph whose adjacency matrix contains a one-dimensional null space spanned by a vector without zero entries. Moreover, an $\ell$-circulant graph is a graph that admits a cyclic group of automorphisms having $\ell$ vertex orbits of equal size. It is not difficult to observe that there exists no cubic $1$-circulant nut graph or cubic $2$-circulant nut graph, while the full classification of all the cubic $3$-circulant nut graphs was recently obtained (Damnjanović et al. in Electron. J. Comb. 31(2):P2.31, 2024). Here, we investigate the existence of cubic $\ell$-circulant nut graphs for $\ell \geq 4$ and show that there is no cubic $4$-circulant nut graph or cubic $5$-circulant nut graph by using a computer-assisted proof. Furthermore, we rely on a construction based approach in order to demonstrate that there exist infinitely many cubic $\ell$-circulant nut graphs for any fixed $\ell \in \{6, 7\}$ or $\ell \geq 9$.
Ključne besede: nut graph, polycirculant graph, cubic graph, pregraph, voltage graph
Objavljeno v RUP: 19.11.2025; Ogledov: 260; Prenosov: 5
 Celotno besedilo (581,83 KB)
Gradivo ima več datotek! Več... |
2. Polycyclic geometric realizations of the Gray configurationLeah Berman, Gábor Gévay, Tomaž Pisanski, 2025, izvirni znanstveni članek Opis: The Gray configuration is a (27_3) configuration which typically is realized as the points and lines of the 3×3×3 integer lattice. It occurs as a member of an infinite family of configurations defined by Bouwer in 1972. Since their discovery, both the Gray configuration and its Levi graph (i.e., its point-line incidence graph) have been the subject of intensive study. Its automorphism group contains cyclic subgroups isomorphic to Z3 and Z9, so it is natural to ask whether the Gray configuration can be realized in the plane with any of the corresponding rotational symmetry. In this paper, we show that there are two distinct polycyclic realizations with Z3 symmetry. In contrast, the only geometric polycyclic realization with straight lines and Z9 symmetry is only a “weak” realization, with extra unwanted incidences (in particular, the realization is actually a (27_4) configuration).
Ključne besede: Gray graph, Gray configuration, polycirculant, polycyclic configuration
Objavljeno v RUP: 29.09.2025; Ogledov: 410; Prenosov: 4
Celotno besedilo (2,95 MB) |
3. The Gray graph is a unit-distance graphLeah Berman, Gábor Gévay, Tomaž Pisanski, 2025, izvirni znanstveni članek Opis: In this note we give a construction proving that the Gray graph, which is the smallestcubic semisymmetric graph, is a unit-distance graph.
Ključne besede: polycirculant, unit-distance graph, Gray graph, ADAM graph, generalized Petersen graph
Objavljeno v RUP: 10.09.2025; Ogledov: 485; Prenosov: 0
Celotno besedilo (951,83 KB) |
4. Semiregular automorphisms in vertex-transitive graphs with a solvable group of automorphismsDragan Marušič, 2017, izvirni znanstveni članek Opis: 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.
Ključne besede: solvable group, semiregular automorphism, fixed-point-free automorphism, polycirculant conjecture
Objavljeno v RUP: 03.01.2022; Ogledov: 2103; Prenosov: 26
Celotno besedilo (235,26 KB) |
5. |
6. |
