Dragan Marušič
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Dragan Marušič has a total of 143 co-authors. Here are the top co-authors by number of shared publications:
- Klavdija Kutnar
University of Primorska
45 shared publications - Aleksander Malnič
University of Ljubljana
26 shared publications - Ademir Hujdurović
University of Primorska
8 shared publications Primož Potočnik
University of Ljubljana and Institute of Mathematics, Physics, and Mechanics, Jadranska 19, 1111 Ljubljana, Slovenia
8 shared publicationsPrimož Šparl
University of Ljubljana, University of Primorska
8 shared publicationsIstván Kovács
6 shared publications
Latest Publications
- 20 June 2024
- Published by Springer Nature in Annals of Combinatorics
- Vol. 28 (4) , 1243-1255
Infinite Families of Vertex-Transitive Graphs with Prescribed Hamilton Compression
- 20 June 2024
- Published by Springer Nature in Annals of Combinatorics
- Vol. 28 (4) , 1243-1255
Infinite Families of Vertex-Transitive Graphs with Prescribed Hamilton Compression
- Open Access
Infinite families of vertex-transitive graphs with prescribed Hamilton compression
Given a graph $X$ with a Hamilton cycle $C$, the {\em compression factor $κ(X,C)$ of $C$} is the order of the largest cyclic subgroup of $\operatorname{Aut}(C)\cap\operatorname{Aut}(X)$, and the {\em Hamilton compression $κ(X)$ of $X$ } is the maximum of $κ(X,C)$ where $C$ runs over all Hamilton cycles in $X$. Generalizing the well-known open problem regarding the existence of vertex-transitive graphs without Hamilton paths/cycles, it was asked by Gregor, Merino and Mütze in [``The Hamilton compression of highly symmetric graphs'', {\em arXiv preprint} arXiv: 2205.08126v1 (2022)] whether for every positive integer $k$ there exists infinitely many vertex-transitive graphs (Cayley graphs) with Hamilton compression equal to $k$. Since an infinite family of Cayley graphs with Hamilton compression equal to $1$ was given there, the question is completely resolved in this paper in the case of Cayley graphs with a construction of Cayley graphs of semidirect products $\mathbb{Z}_p\rtimes\mathbb{Z}_k$ where $p$ is a prime and $k \geq 2$ a divisor of $p-1$. Further, infinite families of non-Cayley vertex-transitive graphs with Hamilton compression equal to $1$ are given. All of these graphs being metacirculants, some additional results on Hamilton compression of metacirculants of specific orders are also given.Open AccessInfinite families of vertex-transitive graphs with prescribed Hamilton compression
Given a graph $X$ with a Hamilton cycle $C$, the {\em compression factor $κ(X,C)$ of $C$} is the order of the largest cyclic subgroup of $\operatorname{Aut}(C)\cap\operatorname{Aut}(X)$, and the {\em Hamilton compression $κ(X)$ of $X$ } is the maximum of $κ(X,C)$ where $C$ runs over all Hamilton cycles in $X$. Generalizing the well-known open problem regarding the existence of vertex-transitive graphs without Hamilton paths/cycles, it was asked by Gregor, Merino and Mütze in [``The Hamilton compression of highly symmetric graphs'', {\em arXiv preprint} arXiv: 2205.08126v1 (2022)] whether for every positive integer $k$ there exists infinitely many vertex-transitive graphs (Cayley graphs) with Hamilton compression equal to $k$. Since an infinite family of Cayley graphs with Hamilton compression equal to $1$ was given there, the question is completely resolved in this paper in the case of Cayley graphs with a construction of Cayley graphs of semidirect products $\mathbb{Z}_p\rtimes\mathbb{Z}_k$ where $p$ is a prime and $k \geq 2$ a divisor of $p-1$. Further, infinite families of non-Cayley vertex-transitive graphs with Hamilton compression equal to $1$ are given. All of these graphs being metacirculants, some additional results on Hamilton compression of metacirculants of specific orders are also given. - Open Access
- 3 April 2023
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 57 (4) , 1313-1326
Intersection density of cubic symmetric graphs
Two elements g, h of a permutation group G acting on a set V are said to be intersecting if $$g(v) = h(v)$$ for some $$v \in V$$ . More generally, a subset $$\mathcal {F}$$ of G is an intersecting set if every pair of elements of $$\mathcal {F}$$ is intersecting. The intersection density $$\rho (G)$$ of a transitive permutation group G is the maximum value of the quotient $$|\mathcal {F}|/|G_v|$$ where $$\mathcal {F}$$ runs over all intersecting sets in G and $$G_v$$ is the stabilizer of $$v \in V$$ . A vertex-transitive graph X is intersection density stable if any two transitive subgroups of $${\textrm{Aut}}\,(X)$$ have the same intersection density. This paper studies the above concepts in the context of cubic symmetric graphs. While a 1-regular cubic symmetric graph is necessarily intersection density stable, the situation for 2-arc-regular cubic symmetric graphs is more complex. A necessary condition for a 2-arc-regular cubic symmetric graph admitting a 1-arc-regular subgroup of automorphisms to be intersection density stable is given, and an infinite family of such graphs is constructed.- 3 April 2023
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 57 (4) , 1313-1326
Open AccessIntersection density of cubic symmetric graphs
Two elements g, h of a permutation group G acting on a set V are said to be intersecting if $$g(v) = h(v)$$ for some $$v \in V$$ . More generally, a subset $$\mathcal {F}$$ of G is an intersecting set if every pair of elements of $$\mathcal {F}$$ is intersecting. The intersection density $$\rho (G)$$ of a transitive permutation group G is the maximum value of the quotient $$|\mathcal {F}|/|G_v|$$ where $$\mathcal {F}$$ runs over all intersecting sets in G and $$G_v$$ is the stabilizer of $$v \in V$$ . A vertex-transitive graph X is intersection density stable if any two transitive subgroups of $${\textrm{Aut}}\,(X)$$ have the same intersection density. This paper studies the above concepts in the context of cubic symmetric graphs. While a 1-regular cubic symmetric graph is necessarily intersection density stable, the situation for 2-arc-regular cubic symmetric graphs is more complex. A necessary condition for a 2-arc-regular cubic symmetric graph admitting a 1-arc-regular subgroup of automorphisms to be intersection density stable is given, and an infinite family of such graphs is constructed. - 15 February 2022
- Published by Taylor & Francis in Communications in Algebra
- Vol. 50 (8) , 3516-3523
Semiregular elements in transitive 2-closed permutation groups of certain degrees
A nonidentity element of a permutation group is said to be semiregular provided all of its cycles in its cycle decomposition are of the same length. It is known that semiregular elements exist in transitive 2-closed permutation groups of square-free degree and in some special cases when the degree is divisible by a square of a prime. In this paper it is shown that semiregular elements exist in transitive 2-closed permutation groups of the following degrees As a corollary, a 2-closed transitive permutation group of degree and different from 72 and 96 contains semiregular elements.- 15 February 2022
- Published by Taylor & Francis in Communications in Algebra
- Vol. 50 (8) , 3516-3523
Semiregular elements in transitive 2-closed permutation groups of certain degrees
A nonidentity element of a permutation group is said to be semiregular provided all of its cycles in its cycle decomposition are of the same length. It is known that semiregular elements exist in transitive 2-closed permutation groups of square-free degree and in some special cases when the degree is divisible by a square of a prime. In this paper it is shown that semiregular elements exist in transitive 2-closed permutation groups of the following degrees As a corollary, a 2-closed transitive permutation group of degree and different from 72 and 96 contains semiregular elements.- 1 August 2021
- Published by Springer Nature in Combinatorica
- Vol. 41 (4) , 507-543
Resolving The Hamiltonian Problem for Vertex-Transitive Graphs of Order a Product of Two Primes
- 1 August 2021
- Published by Springer Nature in Combinatorica
- Vol. 41 (4) , 507-543
Resolving The Hamiltonian Problem for Vertex-Transitive Graphs of Order a Product of Two Primes
- 20 April 2021
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 18 (3) , 1-15
Bicirculants via Imprimitivity Block Systems
- 20 April 2021
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 18 (3) , 1-15
Bicirculants via Imprimitivity Block Systems
- 13 June 2020
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 53 (3) , 881-895
Symmetric cubic graphs via rigid cells
- 13 June 2020
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 53 (3) , 881-895
Symmetric cubic graphs via rigid cells
- Open Access
- 30 December 2019
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 2 (1) , #P1.10
Polynomials of degree 4 over finite fields representing quadratic residues
It is proved that in a finite field F of prime order p, where p is not one of finitely many exceptions, for every polynomial f(x) ∈ F[x] of degree 4 that has a nonzero constant term and is not of the form αg(x)2 there exists a primitive root β ∈ F such that f(β) is a quadratic residue in F. This refines a result of Madden and Vélez from 1982 about polynomials that represent quadratic residues at primitive roots.
- 30 December 2019
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 2 (1) , #P1.10
Open AccessPolynomials of degree 4 over finite fields representing quadratic residues
It is proved that in a finite field F of prime order p, where p is not one of finitely many exceptions, for every polynomial f(x) ∈ F[x] of degree 4 that has a nonzero constant term and is not of the form αg(x)2 there exists a primitive root β ∈ F such that f(β) is a quadratic residue in F. This refines a result of Madden and Vélez from 1982 about polynomials that represent quadratic residues at primitive roots.
- 1 July 2019
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 353, 329-337
Quasi-semiregular automorphisms of cubic and tetravalent arc-transitive graphs
- 1 July 2019
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 353, 329-337
Quasi-semiregular automorphisms of cubic and tetravalent arc-transitive graphs
- 1 May 2019
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 136, 170-192
Odd extensions of transitive groups via symmetric graphs – The cubic case
- 1 May 2019
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 136, 170-192
Odd extensions of transitive groups via symmetric graphs – The cubic case