Related papers: The Cayley graph of a quandle
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…
Extending earlier results of Godsil and of Dobson and Malnic on Johnson graphs, we characterise those merged Johnson graphs $J=J(n,k)_I$ which are Cayley graphs, that is, which are connected and have a group of automorphisms acting…
The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley…
We define biquandle structures on a given quandle, and show that any biquandle is given by some biquandle structure on its underlying quandle. By determining when two biquandle structures yield isomorphic biquandles, we obtain a…
A graph $\G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over $H$. Such a graph $\G$ is called {\em normal\/} if $H$ is normal in the full…
From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…
We are intereseted in quandles and their enveloping groups. Various results are proven. We show that a quandle $Q$ and its image in the enveloping group $G(Q)$ have isomorphic enveloping groups. The image quandle is injective. For $Q$ a…
In this paper, we introduce and initiate the study of quandle products of groups, a family of groups that includes graph products of groups, cactus groups, wreath products, and the recently introduced trickle groups. Our approach is…
It has long been known that a vertex-transitive graph $\Gamma$ is isomorphic to a double coset graph $\text{Cos}(G,H,S)$ of a transitive group $G\le\text{Aut}(\Gamma)$, a vertex stabilizer $H\le G$, and some subset $S\subseteq G$. We show…
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…
In this paper we provide the conditions under which an automorphism or an antiautomorphism of a group $G$ induces an automorphism or an antiautomorphism of the $m$-conjugation quandle $\operatorname{Conj_{m}}(G),\,\, m\in \mathbb{Z} $, the…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…
We show that the directed labelled Cayley graphs coincide with the rooted deterministic vertex-transitive simple graphs. The Cayley graphs are also the strongly connected deterministic simple graphs of which all vertices have the same cycle…
In this work we characterise Cayley graphs of Coxeter groups with respect to the standard generating set that admit uncountable vertex stabilisers. As a corollary, we fully identify finitely generated Coxeter groups for which the…
We compute Cayley graphs and automorphism groups for all finite $n$-quandles of two-bridge and torus knots and links, as well as torus links with an axis.
In this paper the structure of the Cayley graphs and G-graphs of some gyro-groups are studied and some properties of them will be proved. Moreover we review some special gyro-groups including: gyro-commutative gyrogroups, dihedral…
These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley…
In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…
Quandles with good involutions, which are called symmetric quandles, can be used to define invariants of unoriented knots and links. In this paper, we determine the necessary and sufficient condition for good involutions of a generalized…
In the paper we describe the class of principal quandles and show that connected quandles can be decomposed as a disjoint union of principal quandles. We also prove that simple affine quandles are finite and they can be characterized among…