相关论文: New constructions of divisible design Cayley graph…
We investigate Cayley graphs of finite semigroups and monoids. First, we look at semigroup digraphs, i.e., directed Cayley graphs of semigroups, and give a Sabidussi-type characterization in the case of monoids. We then correct a proof of…
An infinite family of bounded-degree 'unique-neighbor' expanders was constructed explicitly by Alon and Capalbo (2002). We present an infinite family F of bounded-degree unique-neighbor expanders with the additional property that every…
We construct an infinite family of connected, 2-generated Cayley digraphs Cay(G;a,b) that do not have hamiltonian paths, such that the orders of the generators a and b are arbitrarily large. We also prove that if G is any finite group with…
A directed diameter of a directed graph is the maximum possible distance between a pair of vertices, where paths must respect edge orientations, while undirected diameter is the diameter of the undirected graph obtained by symmetrizing the…
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…
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…
This paper deals with some of the algebraic properties of Sierpi\'nski graphs and a family of regular generalized Sierpi\'nski graphs. For the family of regular generalized Sierpi\'nski graphs, we obtain their spectrum and characterize…
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…
Deep learning has been shown to be successful in a number of domains, ranging from acoustics, images, to natural language processing. However, applying deep learning to the ubiquitous graph data is non-trivial because of the unique…
We show that the total variation mixing time is not quasi-isometry invariant, even for Cayley graphs. Namely, we construct a sequence of pairs of Cayley graphs with maps between them that twist the metric in a bounded way, while the ratio…
The existence of nonconstant harmonic Dirichlet functions on a Cayley graph of a discrete group is equivalent to the nonvanishing of the first L2-cohomology of the given group. It was first proven by Cheeger and Gromov that such functions…
A \emph{mixed dihedral group} is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper we give a sufficient condition…
We conservatively extend classical elementary differential calculus to the Cartesian closed category of convergence spaces. By specializing results about the convergence space representation of directed graphs, we use Cayley graphs to…
In this paper, we give a new class of reconstructible graphs, which is an extension of my paper `A class of reconstructible graphs'.
Huang proved that every set of more than half the vertices of the $d$-dimensional hypercube $Q_d$ induces a subgraph of maximum degree at least $\sqrt{d}$, which is tight by a result of Chung, F\"uredi, Graham, and Seymour. Huang asked…
In this paper, we characterize some certain directed strongly regular Cayley graphs on Dihedral groups $D_{n}$, where $n\geqslant 3$ is a positive integer.
We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or thickened $K_{3,m}$'s. Our construction is explicit,…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
It is known that the number of vertices of a graph of diameter two cannot exceed $d^2+1$. In this contribution we give a new lower bound for orders of Cayley graphs of diameter two in the form $C(d,2)>0.684d^2$ valid for all degrees $d\geq…
We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.