Ademir Hujdurović
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
Ademir Hujdurović has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Klavdija Kutnar
University of Primorska
18 shared publications - Martin Milanič
University of Primorska
11 shared publications - Dragan Marušič
University of Primorska, UP IAM, Koper, Slovenia
8 shared publications - Joy Morris
University of Lethbridge
6 shared publications - Bernard Ries
Department of Informatics, University of Fribourg, Fribourg, Switzerland
5 shared publications - Alexandru Ioan Tomescu
Department of Computer Science, University of Helsinki, Helsinki, Finland
4 shared publications
Latest Publications
- Open Access
- 19 August 2025
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 8 (1) , #P1.12-16 pp.
On cubic vertex-transitive graphs of given girth
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.
- 19 August 2025
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 8 (1) , #P1.12-16 pp.
Open AccessOn cubic vertex-transitive graphs of given girth
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.
- Open Access
- 11 April 2025
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 32 (2) , P2.49
Stability of Cayley Graphs and Schur Rings
A graph $\Gamma$ is said to be unstable if for the direct product $\Gamma \times K_2$, $\mathrm{Aut}(\Gamma \times K_2)$ is not isomorphic to $\mathrm{Aut}(\Gamma) \times \mathbb{Z}_2$. We show that a connected and non-bipartite Cayley graph $\mathrm{Cay}(H,S)$ is unstable if and only if the set $S \times \{1\}$ belongs to a Schur ring over the group $H \times \mathbb{Z}_2$ satisfying certain properties. The S-rings with these properties are characterized if $H$ is a cyclic group of twice odd order. As an application, a necessary and sufficient condition is given for a connected and non-bipartite circulant graph of order $2p^e$ to be unstable, where $p$ is an odd prime and $e \ge 1$.- 11 April 2025
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 32 (2) , P2.49
Open AccessStability of Cayley Graphs and Schur Rings
A graph $\Gamma$ is said to be unstable if for the direct product $\Gamma \times K_2$, $\mathrm{Aut}(\Gamma \times K_2)$ is not isomorphic to $\mathrm{Aut}(\Gamma) \times \mathbb{Z}_2$. We show that a connected and non-bipartite Cayley graph $\mathrm{Cay}(H,S)$ is unstable if and only if the set $S \times \{1\}$ belongs to a Schur ring over the group $H \times \mathbb{Z}_2$ satisfying certain properties. The S-rings with these properties are characterized if $H$ is a cyclic group of twice odd order. As an application, a necessary and sufficient condition is given for a connected and non-bipartite circulant graph of order $2p^e$ to be unstable, where $p$ is an odd prime and $e \ge 1$. - Open Access
- 11 April 2025
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 32 (2) , P2.34
Classification of Vertex-Transitive Digraphs of Order a Product of Two Distinct Primes via Automorphism Group
In the mid-1990s, two groups of authors independently obtained classifications of vertex-transitive graphs whose order is a product of two distinct primes. In the intervening years it has become clear that there is additional information concerning these graphs that would be useful, as well as making explicit the extensions of these results to digraphs. Additionally, there are several small errors in some of the papers that were involved in this classification. The purpose of this paper is to fill in the missing information as well as correct all known errors.
- 11 April 2025
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 32 (2) , P2.34
Open AccessClassification of Vertex-Transitive Digraphs of Order a Product of Two Distinct Primes via Automorphism Group
In the mid-1990s, two groups of authors independently obtained classifications of vertex-transitive graphs whose order is a product of two distinct primes. In the intervening years it has become clear that there is additional information concerning these graphs that would be useful, as well as making explicit the extensions of these results to digraphs. Additionally, there are several small errors in some of the papers that were involved in this classification. The purpose of this paper is to fill in the missing information as well as correct all known errors.
- Open Access
- 7 October 2024
- Published by Elsevier in European Journal of Combinatorics
- Vol. 124
Intersection density of transitive groups with small cyclic point stabilizers
- 7 October 2024
- Published by Elsevier in European Journal of Combinatorics
- Vol. 124
Open AccessIntersection density of transitive groups with small cyclic point stabilizers
- Open Access
- 7 August 2023
- Published by Wiley in Journal of Graph Theory
- Vol. 105 (1) , 98-109
Some conditions implying stability of graphs
A graph is said to be unstable if the direct product (also called the canonical double cover of ) has automorphisms that do not come from automorphisms of its factors and . It is nontrivially unstable if it is unstable, connected, nonbipartite, and distinct vertices have distinct sets of neighbours. In this paper, we prove two sufficient conditions for stability of graphs in which every edge lies on a triangle, revising an incorrect claim of Surowski and filling in some gaps in the proof of another one. We also consider triangle‐free graphs, and prove that there are no nontrivially unstable triangle‐free graphs of diameter 2. An interesting construction of nontrivially unstable graphs is given and several open problems are posed.
- 7 August 2023
- Published by Wiley in Journal of Graph Theory
- Vol. 105 (1) , 98-109
Open AccessSome conditions implying stability of graphs
A graph is said to be unstable if the direct product (also called the canonical double cover of ) has automorphisms that do not come from automorphisms of its factors and . It is nontrivially unstable if it is unstable, connected, nonbipartite, and distinct vertices have distinct sets of neighbours. In this paper, we prove two sufficient conditions for stability of graphs in which every edge lies on a triangle, revising an incorrect claim of Surowski and filling in some gaps in the proof of another one. We also consider triangle‐free graphs, and prove that there are no nontrivially unstable triangle‐free graphs of diameter 2. An interesting construction of nontrivially unstable graphs is given and several open problems are posed.
- Open Access
Stability of Cayley graphs and Schur rings
A graph $Γ$ is said to be unstable if for the direct product $Γ\times K_2$, $Aut(Γ\times K_2)$ is not isomorphic to $Aut(Γ) \times \mathbb{Z}_2$. In this paper we show that a connected and non-bipartite Cayley graph $Cay(H,S)$ is unstable if and only if the set $S \times \{1\}$ belongs to a Schur ring over the group $H \times \mathbb{Z}_2$ having certain properties. The Schur rings with these properties are characterized if $H$ is an abelian group of odd order or a cyclic group of twice odd order. As an application, a short proof is given for the result of Witte Morris stating that every connected unstable Cayley graph on an abelian group of odd order has twins (Electron.~J.~Combin, 2021). As another application, sufficient and necessary conditions are given for a connected and non-bipartite circulant graph of order $2p^e$ to be unstable, where $p$ is an odd prime and $e \ge 1$.Open AccessStability of Cayley graphs and Schur rings
A graph $Γ$ is said to be unstable if for the direct product $Γ\times K_2$, $Aut(Γ\times K_2)$ is not isomorphic to $Aut(Γ) \times \mathbb{Z}_2$. In this paper we show that a connected and non-bipartite Cayley graph $Cay(H,S)$ is unstable if and only if the set $S \times \{1\}$ belongs to a Schur ring over the group $H \times \mathbb{Z}_2$ having certain properties. The Schur rings with these properties are characterized if $H$ is an abelian group of odd order or a cyclic group of twice odd order. As an application, a short proof is given for the result of Witte Morris stating that every connected unstable Cayley graph on an abelian group of odd order has twins (Electron.~J.~Combin, 2021). As another application, sufficient and necessary conditions are given for a connected and non-bipartite circulant graph of order $2p^e$ to be unstable, where $p$ is an odd prime and $e \ge 1$. - Open Access
- 1 January 2023
- Published by Masaryk University Press
- p. 362-367
When is Cartesian product a Cayley graph?
A graph is said to be {\it Cayley} graph if its automorphism group admits a regular subgroup. Automorphisms of the Cartesian product of graphs are well understood, and it is known that Cartesian product of Cayley graphs is a Cayley graph. It is natural to ask the reverse question, namely whether all the factors of Cartesian product that is a Cayley graph have to be Cayley graphs. The main purpose of this paper is to initiate the study of this question.
- 1 January 2023
- Published by Masaryk University Press
- p. 362-367
Open AccessWhen is Cartesian product a Cayley graph?
A graph is said to be {\it Cayley} graph if its automorphism group admits a regular subgroup. Automorphisms of the Cartesian product of graphs are well understood, and it is known that Cartesian product of Cayley graphs is a Cayley graph. It is natural to ask the reverse question, namely whether all the factors of Cartesian product that is a Cayley graph have to be Cayley graphs. The main purpose of this paper is to initiate the study of this question.
- Open Access
On some problems regarding distance-balanced graphs
A graph $\Gamma$ is said to be distance-balanced if for any edge $uv$ of $\Gamma$, the number of vertices closer to $u$ than to $v$ is equal to the number of vertices closer to $v$ than to $u$, and it is called nicely distance-balanced if in addition this number is independent of the chosen edge $uv$. A graph $\Gamma$ is said to be strongly distance-balanced if for any edge $uv$ of $\Gamma$ and any integer $k$, the number of vertices at distance $k$ from $u$ and at distance $k+1$ from $v$ is equal to the number of vertices at distance $k+1$ from $u$ and at distance $k$ from $v$. In this paper we answer an open problem posed by Kutnar and Miklavi\v{c} [European J. Combin. 39 (2014), 57-67] by constructing several infinite families of nonbipartite nicely distance-balanced graphs which are not strongly distance-balanced. We disprove a conjecture regarding characterization of strongly distance-balanced graphs posed by Balakrishnan et al. [European J. Combin. 30 (2009), 1048-1053] by providing infinitely many counterexamples, and answer an open question posed by Kutnar et al. in [Discrete Math. 306 (2006), 1881-1894] regarding existence of semisymmetric distance-balanced graphs which are not strongly distance-balanced by providing an infinite family of such examples. We also show that for a graph $\Gamma$ with $n$ vertices and $m$ edges it can be checked in $O(mn)$ time if $\Gamma$ is strongly-distance balanced and if $\Gamma$ is nicely distance-balanced.Open AccessOn some problems regarding distance-balanced graphs
A graph $\Gamma$ is said to be distance-balanced if for any edge $uv$ of $\Gamma$, the number of vertices closer to $u$ than to $v$ is equal to the number of vertices closer to $v$ than to $u$, and it is called nicely distance-balanced if in addition this number is independent of the chosen edge $uv$. A graph $\Gamma$ is said to be strongly distance-balanced if for any edge $uv$ of $\Gamma$ and any integer $k$, the number of vertices at distance $k$ from $u$ and at distance $k+1$ from $v$ is equal to the number of vertices at distance $k+1$ from $u$ and at distance $k$ from $v$. In this paper we answer an open problem posed by Kutnar and Miklavi\v{c} [European J. Combin. 39 (2014), 57-67] by constructing several infinite families of nonbipartite nicely distance-balanced graphs which are not strongly distance-balanced. We disprove a conjecture regarding characterization of strongly distance-balanced graphs posed by Balakrishnan et al. [European J. Combin. 30 (2009), 1048-1053] by providing infinitely many counterexamples, and answer an open question posed by Kutnar et al. in [Discrete Math. 306 (2006), 1881-1894] regarding existence of semisymmetric distance-balanced graphs which are not strongly distance-balanced by providing an infinite family of such examples. We also show that for a graph $\Gamma$ with $n$ vertices and $m$ edges it can be checked in $O(mn)$ time if $\Gamma$ is strongly-distance balanced and if $\Gamma$ is nicely distance-balanced. - 1 February 2022
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 78
On intersection density of transitive groups of degree a product of two odd primes
- 1 February 2022
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 78
On intersection density of transitive groups of degree a product of two odd primes
- Open Access
- 25 August 2021
- Published by Wiley in Journal of Graph Theory
- Vol. 99 (2) , 207-216
Three local actions in 6‐valent arc‐transitive graphs
It is known that there are precisely three transitive permutation groups of degree 6 that admit an invariant partition with three parts of size 2 such that the kernel of the action on the parts has order 4; these groups are called , and . For each , we construct an infinite family of finite connected 6-valent graphs and arc-transitive groups such that the permutation group induced by the action of the vertex-stabiliser on the neighbourhood of a vertex is permutation isomorphic to , and such that is exponential in . These three groups were the only transitive permutation groups of degree at most 7 for which the existence of such a family was undecided. In the process, we construct an infinite family of cubic 2-arc-transitive graphs such that the dimension of the 1-eigenspace over the field of order 2 of the adjacency matrix of the graph grows linearly with the order of the graph.- 25 August 2021
- Published by Wiley in Journal of Graph Theory
- Vol. 99 (2) , 207-216
Open AccessThree local actions in 6‐valent arc‐transitive graphs
It is known that there are precisely three transitive permutation groups of degree 6 that admit an invariant partition with three parts of size 2 such that the kernel of the action on the parts has order 4; these groups are called , and . For each , we construct an infinite family of finite connected 6-valent graphs and arc-transitive groups such that the permutation group induced by the action of the vertex-stabiliser on the neighbourhood of a vertex is permutation isomorphic to , and such that is exponential in . These three groups were the only transitive permutation groups of degree at most 7 for which the existence of such a family was undecided. In the process, we construct an infinite family of cubic 2-arc-transitive graphs such that the dimension of the 1-eigenspace over the field of order 2 of the adjacency matrix of the graph grows linearly with the order of the graph.