On arc-transitive inner-automorphic Cayley graphs on dihedral groups
School of Mathematical Sciences, Laboratory of Mathematics and Complex Systems, MOE Beijing Normal University（北京师范大学数学科学学院、数学与复杂系统教育部重点实验室）；Center for Combinatorics, LPMC Nankai University（南开大学组合数学中心、低维空间拓扑及其应用教育部重点实验室）
A Cayley graph $\Cay(G,S)$ is said to be inner-automorphic if $S$ is a union of conjugacy classes of a group $G$, and arc-transitive if its full automorphism group acts transitively on the set of arcs. In this paper, we characterize four well-known families of arc-transitive graphs that arise as connected inner-automorphic Cayley graphs on dihedral groups, and we provide a necessary condition for other connected arc-transitive Cayley graphs on dihedral groups to be inner-automorphic. We further construct an infinite family of examples satisfying this condition, thereby demonstrating the existence of such graphs. Finally, we complete the classification of all 2-distance-transitive connected inner-automorphic Cayley graphs on dihedral groups.
Automorphic loops are loops in which all inner mappings are automorphisms. A large class of automorphic loops is obtained as follows: Let $m$ be a positive even integer, $G$ an abelian group, and $α$ an automorphism of $G$ that satisfies $α^2=1$ if $m>2$. Then the dihedral-like automorphic loop $\mathrm{Dih}(m,G,α)$ is defined on $\mathbb Z_m\times G$ by $(i,u)(j,v)=(i+j, ((-1)^{j}u+v)α^{ij})$. We prove that two finite dihedral-like automorphic loops $\mathrm{Dih}(m,G,α)$, $\mathrm{Dih}(\overline{m},\overline{G},\overlineα)$ are isomorphic if and only if $m=\overline{m}$, $G=\overline{G}$, and…
A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to $S$ is said to be normal if the right regular representation of $G$ is normal in the automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if there is $α\in Aut(G)$ such that $S^α=T$, whenever $Cay(G,S)\cong Cay(G,T)$ for a Cayley (di)graph $Cay(G,T)$. A finite group $G$ is called a DCI-group or a NDCI-group if all Cayley digraphs or normal Cayley digraphs of $G$ are CI-digraphs, and is called a CI-group or a NCI-group if all Cayley graphs or normal Cayley graphs of $G$ are CI-graphs, respectively. Motivated by a conjecture …
In this paper, we consider the problem on the existence of perfect state transfer(PST for short) on semi-Cayley graphs over abelian groups (which are not necessarily regular), i.e on the graphs having semiregular and abelian subgroups of automorphisms with two orbits of equal size. We stablish a characterization of semi-Cayley graphs over abelian groups having PST. As a result, we give a characterization of Cayley graphs over groups with an abelian subgroup of index 2 having PST, which improves the earlier results on Cayley graphs over abelian groups, dihedral groups and dicyclic group and det…
For a finite group $G$ and subset $S$ of $G,$ the Haar graph $H(G,S)$ is a bipartite regular graph, defined as a regular $G$-cover of a dipole with $|S|$ parallel arcs labelled by elements of $S$. If $G$ is an abelian group, then $H(G,S)$ is well-known to be a Cayley graph; however, there are examples of non-abelian groups $G$ and subsets $S$ when this is not the case. In this paper we address the problem of classifying finite non-abelian groups $G$ with the property that every Haar graph $H(G,S)$ is a Cayley graph. An equivalent condition for $H(G,S)$ to be a Cayley graph of a group containin…
This paper deals with the Cayley graph $\mathrm{Cay}(\mathrm{Sym}_n,T_n),$ where the generating set consists of all block transpositions. A motivation for the study of these particular Cayley graphs comes from current research in Bioinformatics. As the main result, we prove that Aut$(\mathrm{Cay}(\mathrm{Sym}_n,T_n))$ is the product of the left translation group by a dihedral group $\mathsf{D}_{n+1}$ of order $2(n+1)$. The proof uses several properties of the subgraph $Γ$ of $\mathrm{Cay}(\mathrm{Sym}_n,T_n)$ induced by the set $T_n$. In particular, $Γ$ is a $2(n-2)$-regular graph whose automo…
For a finite group $G$ and an inverse-closed generating set $C$ of $G$, let $Aut(G;C)$ consist of those automorphisms of $G$ which leave $C$ invariant. We define an $Aut(G;C)$-invariant normal subgroup $Φ(G;C)$ of $G$ which has the property that, for any $Aut(G;C)$-invariant normal set of generators for $G$, if we remove from it all the elements of $Φ(G;C)$, then the remaining set is still an $Aut(G;C)$-invariant normal generating set for $G$. The subgroup $Φ(G;C)$ contains the Frattini subgroup $Φ(G)$ but the inclusion may be proper. The Cayley graph $Cay(G,C)$ is normal edge-transitive if $A…
A finite group R is a CI-group if, whenever S and T are subsets of R with the Cayley graphs Cay(R,S) and Cay(R,T) isomorphic, there exists an automorphism x of R with S^x=T. The classification of CI-groups is an open problem in the theory of Cayley graphs and is closely related to the isomorphism problem for graphs. This paper is a contribution towards this classification, as we show that every dihedral group of order 6p, with p>3 prime, is a CI-group.
Let $G$ be a finite group, and $S$ be a subset of $G\setminus\{1\}$ such that $S=S^{-1}$. Suppose that $Cay(G,S)$ is the Cayley graph on $G$ with respect to the set $S$ which is the graph whose vertex set is $G$ and two vertices $a,b\in G$ are adjacent if and only if $ab^{-1}\in S$. The adjacency spectrum $Spec(Γ)$ of a graph $Γ$ is the multiset of eigenvalues of its adjacency matrix. A graph $Γ$ is called "determined by its spectrum" (or for short DS) whenever if a graph $Γ'$ has the same spectrum as $Γ$, then $Γ\cong Γ'$. We say that the group $G$ is DS (Cay-DS, respectively) whenever if $Γ$…
As is well-known, the compact groups Spin(7) and SO(7) both have a single conjugacy class of compact subgroups of exceptional type G_2. We first show that if H is a subgroup of Spin(7), and if each element of H is conjugate to some element of G_2, then H itself is conjugate to a subgroup of G_2. The analogous statement for SO(7) turns out be false, and our main result is a classification of all the exceptions. They are the following groups, embedded in each case in SO(7) in a very specific way: GL_2(Z/3Z), SL_2(Z/3Z), Z/4Z x Z/2Z, as well as the nonabelian subgroups of GO_2(C) with compact clo…
Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll \log k \ll \log |G|$ (ie $1 \ll k = |G|^{o(1)}$). A conjecture of Aldous and Diaconis (1985) asserts, for $k\gg\log|G|$, that the random walk on this graph exhibits cutoff. When $\log k \lesssim \log\log|G|$ (ie $k = (\log |G|)^{\mathcal O(1)}$), the only example of a non-Abelian group for which cutoff has been established is the dihedral group. We establish cutoff (as $p\to infty$) for the group of $d \times d$ unit upper triangular matrices with integer entries modulo…
