Search arXivSearch

arXiv · 2503.00859

On CI-property of normal Cayley digraphs over abelian groups

Abstract

A Cayley digraph $Γ$ over a finite group $G$ is said to be CI if for every Cayley digraph $Γ^\prime$ over $G$ isomorphic to $Γ$, there is an isomorphism from $Γ$ to $Γ^\prime$ which is at the same time an automorphism of $G$. In the present paper, we study a CI-property of normal Cayley digraphs over abelian groups, i.e. such Cayley digraphs $Γ$ that the group $G_r$ of all right translations of $G$ is normal in $Aut(Γ)$. At first, we reduce the case of an arbitrary abelian group to the case of an abelian $p$-group. Further, we obtain several results on CI-property of normal Cayley digraphs over abelian $p$-groups. In particular, we prove that every normal Cayley digraph over an abelian $p$-group of order at most $p^5$, where $p$ is an odd prime, is CI.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Grigory Ryabov. 2025-03-02. On CI-property of normal Cayley digraphs over abelian groups. https://arxiv.org/abs/2503.00859

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO