AHAdemir Hujdurović

Ademir Hujdurović

*This is an algorithmically generated author record based on publicly available information.

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:


Latest Publications

  • Open Access

    On cubic vertex-transitive graphs of given girth

    by Ted Dobson, Ademir Hujdurović, Wilfried Imrich, Ronald Ortner

    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

    Stability of Cayley Graphs and Schur Rings

    by Ademir Hujdurović, István Kovács

    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

    Classification of Vertex-Transitive Digraphs of Order a Product of Two Distinct Primes via Automorphism Group

    by Ted Dobson, Ademir Hujdurović, Klavdija Kutnar, Joy Morris

    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

    Intersection density of transitive groups with small cyclic point stabilizers

    by Ademir Hujdurović, István Kovács, Klavdija Kutnar, Dragan Marušič


  • Open Access

    Some conditions implying stability of graphs

    by Ademir Hujdurović, Ðorđe Mitrović

    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

    by Ademir Hujdurović, István Kovács

    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

    When is Cartesian product a Cayley graph?

    by Edward Dobson, Ademir Hujdurović, Wilfried Imrich, Ronald Ortner

    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

    by Blas Fernandez, Ademir Hujdurovic

    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.

  • On intersection density of transitive groups of degree a product of two odd primes

    by Ademir Hujdurović, Klavdija Kutnar, Bojan Kuzma, Dragan Marušič, Štefko Miklavič, Marko Orel


  • Open Access

    Three local actions in 6‐valent arc‐transitive graphs

    by Ademir Hujdurović, Primož Potočnik, Gabriel Verret

    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 A 4 ( 6 ) , S 4 ( 6 d ) and S 4 ( 6 c ) . For each L ∈ { A 4 ( 6 ) , S 4 ( 6 d ) , S 4 ( 6 c ) } , we construct an infinite family of finite connected 6-valent graphs { Γ n } n ∈ N and arc-transitive groups G n ≤ Aut ( Γ n ) such that the permutation group induced by the action of the vertex-stabiliser ( G n ) v on the neighbourhood of a vertex v is permutation isomorphic to L , and such that ∣ ( G n ) v ∣ is exponential in ∣ V ( Γ n ) ∣ . 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.