Related papers: Normal edge-transitive Cayley graphs and Frattini-…

We say that a group G is a cube group if it is generated by a set S of involutions such that the corresponding Cayley graph Cay(G,S) is isomorphic to a cube. Equivalently, G is a cube group if it acts on a cube such that the action 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…

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

Given graphs $G$ and $H$, the generalized Tur\'{a}n number ${\rm ex}(G,H)$ is the maximum number of edges in an $H$-free subgraph of $G$. In this paper, we obtain an asymptotic upper bound on ${\rm ex}(CT_n,C_{2l})$ for any $n \ge 3$ and…

In an early work from 1896, Maschke established the complete list of all finite planar Cayley graphs. This result initiated a long line of research over the next century, aiming at characterizing in a similar way all planar infinite Cayley…

Let $\mathcal{OG}(4)$ denote the family of all graph-group pairs $(\Gamma,G)$ where $\Gamma$ is 4-valent, connected and $G$-oriented ($G$-half-arc-transitive). Using a novel application of the structure theorem for biquasiprimitive…

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the least number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We prove that there is a positive constant $c$…

This paper initiates the investigation of the family of $(G,s)$-geodesic-transitive digraphs with $s\geq 2$. We first give a global analysis by providing a reduction result. Let $\Gamma$ be such a digraph and let $N$ be a normal subgroup of…

A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \gg \frac{\log n}{n}$, the random graph $G(n,p)$ is…

A graph is vertex-transitive if its automorphism group acts transitively on vertices of the graph. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper,…

A connected, locally finite graph $\Gamma$ is a Cayley--Abels graph for a totally disconnected, locally compact group $G$ if $G$ acts vertex-transitively with compact, open vertex stabilizers on $\Gamma$. Define the minimal degree of $G$ as…

A finite group $G$ is said to be Cayley integral if every undirected Cayley graph $\operatorname{Cay}(G,S)$ on $G$ is integral. In this paper, we introduce three natural extensions of this concept; namely as: Cayley colour integral,…

We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…

We show that if G is a nontrivial, finite group of odd order, whose commutator subgroup [G,G] is cyclic of order p^m q^n, where p and q are prime, then every connected Cayley graph on G has a hamiltonian cycle.

Given a connected graph G with p vertices and q edges, the G-graphicahedron is a vertex-transitive simple abstract polytope of rank q whose edge-graph is isomorphic to a Cayley graph of the symmetric group S_p associated with G. The paper…

In the present paper, which is a direct sequel of our paper [12] joint with Roozbeh Hazrat, we prove unrelativised version of the standard commutator formula in the setting of Chevalley groups. Namely, let $\Phi$ be a reduced irreducible…

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…

Given a quasi-transitive infinite graph $G$ with volume growth rate ${\rm gr}(G),$ a transient biased electric network $(G,\, c_1)$ with bias $\lambda_1\in (0,\,{\rm gr}(G))$ and a recurrent biased one $(G,\, c_2)$ with bias $\lambda_2\in…

Let $S_n$ denote the symmetric group of degree $n$ with $n\geq 3$. Set $S=\{c_n=(1\ 2\ldots \ n),c_n^{-1},(1\ 2)\}$. Let $\Gamma_n=\mathrm{Cay}(S_n,S)$ be the Cayley graph on $S_n$ with respect to $S$. In this paper, we show that $\Gamma_n$…

If $X$ is a commutative ring with unity, then the unitary Cayley graph of $X$, denoted $G_X$, is defined to be the graph whose vertex set is $X$ and whose edge set is $\{\{a,b\}\colon a-b\in X^\times\}$. When $R$ is a Dedekind domain and…