Related papers: Enumerating Cayley digraphs on dihedral groups

This paper deals with the Cayley graph $\Cay,$ 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. We prove that…

We estimate the number of graphical regular representations (GRRs) of a given group with large enough order. As a consequence, we show that almost all finite Cayley graphs have full automorphism groups 'as small as possible'. This confirms…

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…

In this paper, we show the existence of a polynomial time graph isomorphism algorithm for all graphs excluding graphs that are locally trianglefree. This particular class of graphs allows to divide the graph into neighbourhood sub-graph…

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…

We are interested in various aspects of spectral rigidity of Cayley and Schreier graphs of finitely generated groups. For each pair of integers $d\geq 2$ and $m \ge 1$, we consider an uncountable family of groups of automorphisms of the…

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)…

Strongly regular Cayley graphs with Paley parameters over abelian groups of rank 2 were studied in [J.A Davis, Partial difference sets in p-groups, Arch.Math.63 (1994) 103-110; K.H Leung, S.L. Ma, Partial difference sets with Paley…

This article lays the foundations for an analogue of geometric group theory that studies actions on graphs by right quasigroups, including racks and quandles. We study markings of graphs that realize racks, and we introduce (di)graph…

In this note, we provide several constructions of Deza Cayley graphs over groups having a generalized dihedral subgroup. These constructions are based on a usage of (relative) difference sets.

We apply spectral analysis of quotients of the Bruhat-Tits buildings of type $\tilde{A}_{d-1}$ to construct isospectral non-isomorphic Cayley graphs of the finite simple groups $\operatorname{PSL}_d({\mathbb F}_q)$ for every $d \geq 5$ ($d…

The problem of constructing or characterizing strongly regular Cayley graphs (or equivalently, regular partial difference sets) has garnered significant attention over the past half-century. In 2003, Miklavi\v{c} and Poto\v{c}nik [European…

The problem of classifying equivalence classes of presentations up to isomorphism of Cayley graphs is considered in this article in the case of dicyclic groups. The number of equivalence classes of presentations is uniformly bounded - it is…

Counting homomorphisms between cyclic groups is a common exercise in a first course in abstract algebra. A similar problem, accessible at the same level, is to count the number of group homomorphisms from a dihedral group of order $2m$ into…

Let $G$ be a group and let $S$ be an inverse-closed and identity-free generating set of $G$. The \emph{Cayley graph} $\Cay(G,S)$ has vertex-set $G$ and two vertices $u$ and $v$ are adjacent if and only if $uv^{-1}\in S$. Let $CAY_d(n)$ be…

In the present paper we investigate the faithfulness of certain linear representations of groups of automorphisms of a graph $X$ in the group of symmetries of the Jacobian of $X$. As a consequence we show that if a $3$-edge-connected graph…

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…

A Cayley graph on a group $G$ has a natural edge-colouring. We say that such a graph is CCA if every automorphism of the graph that preserves this edge-colouring is an element of the normaliser of the regular representation of $G$. A group…

The \textbf{Co-Prime Order Graph} $\Theta (G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $\Theta (G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime.…