Related papers: Fourier analysis on distance-regular Cayley graphs…
A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite families of finite groups that do not admit GRRs : abelian…
A characterization is completed for finite groups acting arc-transitively on maps with square-free Euler characteristic, associated with infinite families of regular maps of square-free Euler characteristic presented. This is based on a…
We study the unitary Cayley graph of a matrix semiring. We find bounds for its diameter, clique number and independence number, and determine its girth. We also find the relationship between the diameter and the clique number of a unitary…
A subperiodic group is a group of motions of $d$-dimensional Euclidean space $\R^d$ which contains a translation lattice $\Z^r$ of rank $r < d$ as a subgroup of finite index. A classification into abstract group isomorphism classes is…
The isomorphism problem for digraphs is a fundamental problem in graph theory. In this paper, we consider this problem for $m$-Cayley digraphs which are generalization of Cayley digraphs. Let $m$ be a positive integer. A digraph admitting a…
This is a survey of several exciting recent results in which techniques originating in the area known as additive combinatorics have been applied to give results in other areas, such as group theory, number theory and theoretical computer…
Skew morphisms, which generalise automorphisms for groups, provide a fundamental tool for the study of regular Cayley maps and, more generally, for finite groups with a complementary factorisation $G=BY$, where $Y$ is cyclic and core-free…
We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…
We adapt the theory of partition rank and analytic rank to the category of abelian groups. If $A_1, \dots, A_k$ are finite abelian groups and $\phi : A_1 \times \cdots \times A_k \to \mathbf{T}$ is a multilinear map, where $\mathbf{T} =…
In geometric group theory one uses group actions on spaces to gain information about groups. One natural space to use is the Cayley graph of a group. The Cayley graph arguments that one encounters tend to require local finiteness, and hence…
Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…
In this paper, we study the metric dimension of Cayley graphs. Specially, we present a complete characterization of Cayley graphs on Abelian groups whose metric dimension is two.
Owing to their interesting spectral properties, the synthetic crystals over lattices other than regular Euclidean lattices, such as hyperbolic and fractal ones, have attracted renewed attention, especially from materials and meta-materials…
We improve upper bounds of F. R. K. Chung and of M. Lu, D. Wan, L.-P. Wang, X.-D. Zhang on the diameter of some Cayley graphs constructed from polynomials over finite fields.
Fiol, Garriga, and Yebra introduced the notion of pseudo-distance-regular vertices, which they used to develop a new characterization of distance-regular graphs. Building on that work, Fiol and Garriga developed the spectral excess theorem…
In this paper, we investigate structural properties of the Cayley graph of a quandle and describe this graph for several important classes of quandles, including conjugation, Takasaki, dihedral, and Alexander quandles. In particular, we…
Resolving parameters is a fundamental area of combinatorics with applications not only to many branches of combinatorics but also to other sciences. In this article, we construct a class of Toeplitz graphs, and will be denoted by…
The Jacobian group of a graph is a finite abelian group through which we can study the graph in an algebraic way. When the graph is a finite abelian covering of another graph, the Jacobian group is equipped with the action of the Galois…
We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual…
An important problem in the field of graph signal processing is developing appropriate overcomplete dictionaries for signals defined on different families of graphs. The Cayley graph of the symmetric group has natural applications in ranked…