1. The Möbius-Kantor graph is a faithful unit-distance graphNino Bašić, Gábor Gévay, Tomaž Pisanski, 2026, original scientific article Abstract: In this paper, it has been shown that the generalized Petersen graph GP(8, 3), also known as the Möbius-Kantor graph, admits a faithful unit-distance representation in the plane.
Keywords: polycirculant, unit-distance graph, Möbius–Kantor graph, generalized Petersen graph
Published in RUP: 08.09.2026; Views: 73; Downloads: 0 |
2. Group distance magic cubic graphsSylwia Cichacz, Štefko Miklavič, 2026, original scientific article Abstract: A $\Gamma$-distance magic labeling of a graph $G = (V, E)$ with $|V| = n$ is a bijection $\ell$ from $V$ to an Abelian group $\Gamma$ of order $n$, for which there exists $\mu \in \Gamma$, such that the weight $w(x) =\sum_{y\in N(x)}\ell(y)$ of every vertex $x \in V$ is equal to $\mu$. In this case, the element $\mu$ is called the magic constant of $G$. A graph $G$ is called a group distance magic if there exists a $\Gamma$-distance magic labeling of $G$ for every Abelian group $\Gamma$ of order $n$. In this paper, we focused on cubic $\Gamma$-distance magic graphs as well as some properties of such graphs.
Keywords: group distance magic labeling, Kotzig array, generalized Petersen graph
Published in RUP: 06.05.2026; Views: 589; Downloads: 10
 Full text (187,65 KB)
This document has more files! More... |
3. Distance-regular Cayley graphs over ℤpˢ ⊕ ℤpXiongfeng Zhan, Lu Lu, Xueyi Huang, 2025, original scientific article Abstract: In 2007, Miklavič and Potočnik proposed the problem of characterizing distance-regular Cayley graphs, which can be viewed as an extension of the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. Let p be an odd prime. In this paper, all distance-regular Cayley graphs over ℤps ⊕ ℤp are identified. It is shown that every such graph is isomorphic to a complete graph, a complete multipartite graph, or the line graph of a transversal design TD(r, p) with 2 ≤ r ≤ p − 1.
Keywords: distance-regular graph, Cayley graph, Schur ring, Fourier transformation, transversal design
Published in RUP: 21.10.2025; Views: 950; Downloads: 9
Full text (461,23 KB) |
4. The Gray graph is a unit-distance graphLeah Berman, Gábor Gévay, Tomaž Pisanski, 2025, original scientific article Abstract: In this note we give a construction proving that the Gray graph, which is the smallestcubic semisymmetric graph, is a unit-distance graph.
Keywords: polycirculant, unit-distance graph, Gray graph, ADAM graph, generalized Petersen graph
Published in RUP: 10.09.2025; Views: 1322; Downloads: 41
Full text (951,83 KB) |
5. Tetravalent distance magic graphs of small order and an infinite family of examplesKsenija Rozman, Primož Šparl, 2025, original scientific article Abstract: A graph of order ▫$n$▫ is distance magic if it admits a bijective labeling of its vertices with integers from ▫$1$▫ to ▫$n$▫ such that each vertex has the same sum of the labels of its neighbors. This paper contributes to the long term project of characterizing all tetravalent distance magic graphs. With the help of a computer we find that out of almost nine million connected tetravalent graphs up to order 16 only nine are distance magic. In fact, besides the six well known wreath graphs there are only three other examples, one of each of the orders 12, 14 and 16. We introduce a generalization of wreath graphs, the so-called quasi wreath graphs, and classify all distance magic graphs among them. This way we obtain infinitely many new tetravalent distance magic graphs. Moreover, the two non-wreath graphs of orders 12 and 14 are quasi wreath graphs while the one of order 16 can be obtained from a quasi wreath graph of order 14 using a simple construction due to Kovář, Fronček and Kovářová.
Keywords: distance magic, tetravalent, quasi wreath graph
Published in RUP: 10.09.2025; Views: 1118; Downloads: 47
Full text (457,53 KB) |
6. The distance function on Coxeter-like graphs and self-dual codesMarko Orel, Draženka Višnjić, 2025, original scientific article Keywords: Coxeter graph, invertible symmetric matrices, binary field, rank, distance in graphs, alternate matrices, self-dual codes
Published in RUP: 30.05.2025; Views: 1479; Downloads: 23
Full text (1,26 MB)
This document has more files! More... |
7. Selected topics on Wiener indexMartin Knor, Riste Škrekovski, Aleksandra Tepeh, 2024, original scientific article Keywords: graph distance, Wiener index, average distance, topological index, molecular descriptor, chemical graph theory
Published in RUP: 26.05.2025; Views: 1536; Downloads: 12
Full text (516,10 KB) |
8. |
9. O nekaterih problemih, ki so povezani s Terwilligerjevimi algebrami in razdaljno-uravnoteženimi grafi : doktorska disertacijaBlas Fernández, 2023, doctoral dissertation Keywords: distance-regularized vertex, pseudo-distance-regularized vertex, Terwilliger algebra, irreducible module, distance-balanced graph, nicely distance-balanced graph, strongly distance-balanced graph
Published in RUP: 15.02.2023; Views: 4566; Downloads: 145
Full text (2,28 MB) |
10. Mathematical aspects of Wiener indexMartin Knor, Riste Škrekovski, Aleksandra Tepeh, 2016, original scientific article Abstract: The Wiener index (i.e., the total distance or the transmission number), defined as the sum of distances between all unordered pairs of vertices in a graph, is one of the most popular molecular descriptors. In this article we summarize some results, conjectures and problems on this molecular descriptor, with emphasis on works we were involved in.
Keywords: Wiener index, total distance, topological index, molecular descriptor, chemical graph theory
Published in RUP: 03.01.2022; Views: 5212; Downloads: 57
Full text (434,58 KB) |
