Related papers: The automorphism group of the Andr\'asfai graph

For $k,s\geq2$, the $s$-stable Kneser graphs are the graphs with vertex set the $k$-subsets $S$ of $\{1,\ldots,n\}$ such that the circular distance between any two elements in $S$ is at least $s$ and two vertices are adjacent if and only if…

In this paper, we consider the automorphism groups of the Cayley graph with respect to the Coxeter generators and the Davis complex of an arbitrary Coxeter group. We determine for which Coxeter groups these automorphism groups are discrete.…

We prove that, to every abstract group $G$, we can associate a sequence of graphs $\Gamma_n$ such that the automorphism group of $\Gamma_n$ is isomorphic to $G$ and the genus of $\Gamma_n$ is an unbounded function of $n$.

In this note we study the automorphism group of a smooth Danielewski surface $D_p= \{(x,y,z) \in \mathbb{A}^3 \mid xy = p(z) \} \subset \mathbb{A}^3$, where $p \in \mathbb{C}[z]$ is a polynomial without multiple roots and $deg (p) \ge 3$.…

We provide an explicit presentation of the automorphism group of an edge-separated CLTTF Artin group.

For a coefficient free cluster algebra $\mathcal{A}$, we study the cluster automorphism group $Aut(\mathcal{A})$ and the automorphism group $Aut(E_{\mathcal{A}})$ of its exchange graph $E_{\mathcal{A}}$. We show that these two groups are…

A Cayley hyper-digraph is a directed hypergraph that its automorphism group contains a subgroup acting regularly on vertices and a Cayley hypermap is a hypermap whose automorphism group contains a subgroup which induces regular action on…

A rack of order $n$ is a binary operation $\rack$ on a set $X$ of cardinality $n$, such that right multiplication is an automorphism. More precisely, $(X,\rack)$ is a rack provided that the map $x\mapsto x\rack y$ is a bijection for all…

We prove that the displacement group of the dihedral quandle with n elements is isomorphic to the group generated by rotations of the n/2-gon when n is even and the n-gon when n is odd. We additionally show that any quandle with at least…

It is shown that a flat subgroup, $H$, of the totally disconnected, locally compact group $G$ decomposes into a finite number of subsemigroups on which the scale function is multiplicative. The image, $P$, of a multiplicative semigroup in…

A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple bipartite graph $\Sigma$ such…

We compute the group of automorphisms of an arbitrary ind-variety of (possibly isotropic) generalized flags. Such an ind-variety is a homogeneous ind-space for one of the ind-groups $SL(\infty)$, $O(\infty)$ or $Sp(\infty)$. We show that…

In this paper, we characterize some certain directed strongly regular Cayley graphs on Dihedral groups $D_{n}$, where $n\geqslant 3$ is a positive integer.

We determine two new infinite families of Cayley graphs that admit colour-preserving automorphisms that do not come from the group action. By definition, this means that these Cayley graphs fail to have the CCA (Cayley Colour Automorphism)…

We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…

The Johnson graph $J(n,i)$ is defined to the graph whose vertex set is the set of all $i$-element subsets of $\{1,\ldots,n\}$, and two vertices are joined whenever the cardinality of their intersection is equal to $i-1$. In Ramras and…

Let $G$ be a finite group, $S\subseteq G\setminus\{1\}$ be a set such that if $a\in S$, then $a^{-1}\in S$, where $1$ denotes the identity element of $G$. The undirected Cayley graph $Cay(G,S)$ of $G$ over the set $S$ is the graph whose…

The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In this paper, we consider this problem for $m$-Cayley digraphs…

An automorphism $\alpha$ of a Cayley graph $Cay(G,S)$ of a group $G$ with connection set $S$ is color-preserving if $\alpha(g,gs) = (h,hs)$ or $(h,hs^{-1})$ for every edge $(g,gs)\in E(Cay(G,S))$. If every color-preserving automorphism of…

The Hasse Weil bound restricts the number of points of a curve which are defined over a finite field; if the number of points meets this bound, the curve is called maximal. Giulietti and Korchmaros introduced a curve C_3 which is maximal…