Related papers: On distance-regular Cayley graphs on abelian group…
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 $\alpha\in Aut(G)$…
In this paper, we give a new lifting construction of "hyperbolic" type of strongly regular Cayley graphs. Also we give new constructions of strongly regular Cayley graphs over the additive groups of finite fields based on partitions of…
We define super-Cayley graphs over a finite abelian group $G$. Using the theory of supercharacters on $G$, we explain how their spectra can be realized as a super-Fourier transform of a superclass characteristic function. Consequently, we…
The girth of a finitely generated group G is the supremum of the girth of Cayley graphs for G over all finite generating sets. Let G be a finitely generated subgroup of the mapping class group Mod(S), where S is a compact orientable…
It is well-known that a complete Riemannian manifold M which is locally isometric to a symmetric space is covered by a symmetric space. Here we prove that a discrete version of this property (called local to global rigidity) holds for a…
Distance-regular graphs have many beautiful combinatorial properties. Distance-transitive graphs have very strong symmetries, and they are distance-regular, i.e. distance-transitivity implies distance-regularity. In this paper, we give…
For any positive integer $k$, let $\mathcal{G}_k$ denote the set of finite groups $G$ such that all Cayley graphs ${\rm Cay}(G,S)$ are integral whenever $|S|\le k$. Est${\rm \acute{e}}$lyi and Kov${\rm \acute{a}}$cs \cite{EK14} classified…
In this paper we introduce a Cayley-type graph for group-subgroup pairs and present some elementary properties of such graphs, including connectedness, their degree and partition structure, and vertex-transitivity. We relate these…
In this paper, we give a necessary and sufficient condition for the integrality of Cayley graphs over the dihedral group $D_n=\langle a,b\mid a^n=b^2=1,bab=a^{-1}\rangle$. Moreover, we also obtain some simple sufficient conditions for the…
A subset $R$ of the vertex set of a graph $\Gamma$ is said to be $(\kappa,\tau)$-regular if $R$ induces a $\kappa$-regular subgraph and every vertex outside $R$ is adjacent to exactly $\tau$ vertices in $R$. In particular, if $R$ is a…
A characterization is given of finite groups $H$ that have skew-morphisms of order coprime to the order $|H|$, and their skew-morphisms. A complete classification is then given of the automorphism groups and the underlying graphs of…
In a graph $\Gamma$ with vertex set $V$, a subset $C$ of $V$ is called an $(a,b)$-perfect set if every vertex in $C$ has exactly $a$ neighbors in $C$ and every vertex in $V\setminus C$ has exactly $b$ neighbors in $C$, where $a$ and $b$ are…
A regular $t$-balanced Cayley map on a group $\Gamma$ is an embedding of a Cayley graph on $\Gamma$ into a surface with certain special symmetric properties. We completely classify regular $t$-balanced Cayley maps for a class of split…
A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…
A Cayley map is a 2-cell embedding of a Cayley graph into an orientable surface with the same local orientation induced by a cyclic permutation of generators at each vertex. In this paper, we provide classifications of prime-valent regular…
When one studies geometric properties of graphs, local finiteness is a common implicit assumption, and that of transitivity a frequent explicit one. By compactness arguments, local finiteness guarantees several regularity properties. It is…
Let $\Sigma=(\Gamma, \sigma)$ is a signed graph(or sigraph in short), where $\Gamma$ is a underlying graph of $\Sigma$ and $\sigma:E\longrightarrow \{+, -\}$ is a function. Consider $\Gamma=Cay(\mathbb{Z}_{p_{1}}\times…
We consider the Cayley graph ${\rm C}(W,S)$ of a Coxeter system $(W,S)$ and describe all maximal $2$-cliques in this graph, i.e. maximal subsets in the vertex set such that the distance between any two distinct elements is equal to $2$. As…
Recently, regular Cayley maps of cyclic groups and dihedral groups have been classified. A nature question is to classify regular Cayley maps of elementary abelian $p$-groups $Z_p^n$. In this paper, a complete classification of regular…
A non-complete graph is \emph{$2$-distance-transitive} if, for $i=1,2$ and for any two vertex pairs $(u_1,v_1)$ and $(u_2,v_2)$ with the same distance $i$ in the graph, there exists an element of the graph automorphism group that maps…