Related papers: The Dilating Method for Cayley digraphs on finite …
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
The diameter of a finite group $G$ with respect to a generating set $A$ is the smallest non-negative integer $n$ such that every element of $G$ can be written as a product of at most $n$ elements of $A \cup A^{-1}$. We denote this invariant…
In this paper we show that almost all Cayley digraphs have automorphism group as small as possible; that is, they are digraphical regular representations (DRRs). More precisely, we show that as $r$ tends to infinity, for every finite group…
Using a Cayley complex (generalizing the Cayley graph) and Clifford algebras, we are able to give, for a large class of finitely presented groups, a uniform construction of spectral triples with $D_{+}$ of index 1.
Let $p$ be an odd prime, and $D_{2p}=\langle \tau,\sigma\mid \tau^p=\sigma^2=e,\sigma\tau\sigma=\tau^{-1}\rangle$ the dihedral group of order $2p$. In this paper, we provide the number of (connected) Cayley (di-)graphs on $D_{2p}$ up to…
In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for all d, being quadratic functions with leading coefficient 1/4…
Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…
In this paper, we study the integral Cayley graphs over a non-abelian group $U_{6n}=\langle a,b\mid a^{2n}=b^3=1, a^{-1}ba=b^{-1}\rangle$ of order $6n$. We give a necessary and sufficient condition for the integrality of Cayley graphs over…
We present families of large undirected and directed Cayley graphs whose construction is related to butterfly networks. One approach yields, for every large $k$ and for values of $d$ taken from a large interval, the largest known Cayley…
The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…
We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…
A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…
In this paper, we study self-complementary distance-regular Cayley graphs over abelian groups. We prove that if a regular graph is self-complementary distance-regular, then it is self-complementary strongly regular. We also deal with…
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…
We report about the results of the application of modern computer algebra tools for construction of directed strongly regular graphs. The suggested techniques are based on the investigation of non-commutative association schemes and Cayley…
We study some properties of the Cayley graph of the R.Thompson's group F in generators $x_0$, $x_1$. We show that the density of this graph, that is, the least upper bound of the average vertex degree of its finite subgraphs is at least 3.…
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.
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…
It is shown that distance powers of an integral Cayley graph over an abelian group are again integral Cayley graphs over that group. Moreover, it is proved that distance matrices of integral Cayley graphs over abelian groups have integral…
We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…