Zobrazeno 1 - 10
of 203
pro vyhledávání: '"ŠPARL, PRIMOŽ"'
Autor:
Kuzman, Boštjan, Šparl, Primož
Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge set $E$ i
Externí odkaz:
http://arxiv.org/abs/2409.01729
Autor:
Rozman, Ksenija, Šparl, Primož
Publikováno v:
Published in Discrete Mathematics, Volume 347, Issue 10, 2024, 114125
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. In this paper we classify all distance magic Cartesian produ
Externí odkaz:
http://arxiv.org/abs/2403.03279
Autor:
Rozman, Ksenija, Šparl, Primož
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 character
Externí odkaz:
http://arxiv.org/abs/2310.09033
Autor:
Alspach, Brian, Sparl, Primoz
Publikováno v:
Published in European Journal of Combinatorics, 120 (2024), Paper No. 103964, 22 pp
We investigate connected cubic vertex-transitive graphs whose edge sets admit a partition into a $2$-factor $\mathcal{C}$ and a $1$-factor that is invariant under a vertex-transitive subgroup of the automorphism group of the graph and where the quoti
Externí odkaz:
http://arxiv.org/abs/2305.19661
Autor:
Berman, Leah Wrenn, Koike, Hiroki, Mochan, Elias, Ramos-Rivera, Alejandra, Sparl, Primoz, Wilson, Stephen E.
Publikováno v:
Published in The Art of Discrete and Applied Mathematics, Vol. 7 No. 2 (2024), #P2.06, 24 pp
A graph is edge-transitive if the natural action of its automorphism group on its edge set is transitive. An automorphism of a graph is semiregular if all of the orbits of the subgroup generated by this automorphism have the same length. While the te
Externí odkaz:
http://arxiv.org/abs/2302.00994
Autor:
Antončič, Iva, Šparl, Primož
A subgroup of the automorphism group of a graph $\G$ is said to be {\em half-arc-transitive} on $\G$ if its action on $\G$ is transitive on the vertex set of $\G$ and on the edge set of $\G$ but not on the arc set of $\G$. Tetravalent graphs of girth
Externí odkaz:
http://arxiv.org/abs/2212.07697
Autor:
Miklavič, Štefko, Šparl, Primož
Publikováno v:
Published in Discrete Applied Mathematics, Volume 329, 2023, Pages 35-48
A graph $\Gamma = (V,E)$ of order $n$ is {\em distance magic} if it admits a bijective labeling $\ell \colon V \to \{1,2, \ldots, n\}$ of its vertices for which there exists a positive integer $\kappa$ such that $\sum_{u \in N(v)} \ell(u) = \kappa$ f
Externí odkaz:
http://arxiv.org/abs/2203.09856
Autor:
Alspach, Brian, Šparl, Primož
Publikováno v:
In European Journal of Combinatorics August 2024 120
We classify trivalent vertex-transitive graphs whose edge sets have a partition into a 2-factor composed of two cycles and a 1-factor that is invariant under the action of the automorphism group.
Comment: 25 pages
Comment: 25 pages
Externí odkaz:
http://arxiv.org/abs/2109.06370
Autor:
Sparl, Primoz
Publikováno v:
Published in Journal of Graph Theory, Vol 99, Issue 3, 2022, pages 414-424
{\em Honeycomb toroidal graphs} are a family of cubic graphs determined by a set of three parameters, that have been studied over the last three decades both by mathematicians and computer scientists. They can all be embedded on a torus and coincide
Externí odkaz:
http://arxiv.org/abs/2011.14609