Related papers: What is and is not inside a Cayley graph?

Recently, several works by a number of authors have provided characterizations of integral undirected Cayley graphs over generalized dihedral groups and generalized dicyclic groups. We generalize and unify these results in two different…

A graph is called an integral graph when all eigenvalues of its adjacency matrix are integers. We study which Cayley graphs over a nonabelian group $$ T_{8n}=\left\langle a,b\mid a^{2n}=b^8=e,a^n=b^4,b^{-1}ab=a^{-1} \right \rangle $$ are…

We give a complete characterisation of the cubic graphs with no eigenvalues in the interval $(-2,0)$. There is one thin infinite family consisting of a single graph on $6n$ vertices for each $n \geqslant 2$, and five ``sporadic'' graphs,…

We investigate which finite Cayley graphs admit a quantum ergodic eigenbasis, proving that this holds for any Cayley graph on a group of size $n$ for which the sum of the dimensions of its irreducible representations is $o(n)$, yet there…

The Pancake graphs $P_n, n\geqslant 2$, are Cayley graphs over the symmetric group $\mathrm{Sym}_n$ generated by prefix-reversals. There are six generating sets of prefix-reversals of cardinality three which give connected Cayley graphs…

Let $G$ be a group and $S\subseteq G$ its subset such that $S=S^{-1}$, where $S^{-1}=\{s^{-1}\mid s\in S\}$. Then {\it the Cayley graph ${\rm Cay}(G,S)$} is an undirected graph $\Gamma$ with the vertex set $V(\Gamma)=G$ and the edge set…

We show that if $n=7k/i$ with $i \in \{1,2,3\}$ then the cop number of the generalised Petersen graph $GP(n,k)$ is $4$, with some small previously-known exceptions. It was previously proved by Ball et al. (2015) that the cop number of any…

We show that every bridgeless cubic graph $G$ on $n$ vertices other than the Petersen graph has a 2-factor with at most $2(n-2)/15$ circuits of length $5$. An infinite family of graphs attains this bound. We also show that $G$ has a…

Let $A$ be an abelian group and let $\iota$ be the automorphism of $A$ defined by $i:a\mapsto a^{-1}$. A Cayley graph $\Gamma=\mathrm{Cay}(A,S)$ is said to have an automorphism group \emph{as small as possible} if $\mathrm{Aut}(\Gamma)=…

Let $G$ be a Cayley graph of the elementary abelian $2$-group $\mathbb{Z}_2^{n}$ with respect to a set $S$ of size $d$. We prove that for any such $G, S$ and $d$, the maximum degree of any induced subgraph of $G$ on any set of more than…

For any positive integer $k$, let $\mathcal{G}_k$ denote the set of finite groups $G$ such that all Cayley graphs ${\rm Cay}(G,S)$ are integral whenever $|S|\le k$. Est${\rm \acute{e}}$lyi and Kov${\rm \acute{a}}$cs \cite{EK14} classified…

A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that its automorphism group ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple…

An internal or friendly partition of a graph is a partition of the vertex set into two nonempty sets so that every vertex has at least as many neighbours in its own class as in the other one. It has been shown that apart from finitely many…

A finite group $G$ is called Cayley integral if all undirected Cayley graphs over $G$ are integral, i.e., all eigenvalues of the graphs are integers. The Cayley integral groups have been determined by Kloster and Sander in the abelian case,…

In this paper we introduce and study a type of Cayley graph -- subnormal Cayley graph. We prove that a subnormal 2-arc transitive Cayley graph is a normal Cayley graph or a normal cover of a complete bipartite graph $K_{p^d,p^d}$ with $p$…

A graph $G=(V,E)$ is a $k$-leaf power if there is a tree $T$ whose leaves are the vertices of $G$ with the property that a pair of leaves $u$ and $v$ induce an edge in $G$ if and only if they are distance at most $k$ apart in $T$. For $k\le…

A well-known conjecture of Babai states that if $G$ is any finite simple group and $X$ is a generating set for $G$, then the diameter of the Cayley graph $Cay(G,X)$ is bounded by $\log|G|^c$ for some universal constant $c$. In this paper,…

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…

We prove that if a graph contains the complete bipartite graph $K_{134, 12}$ as an induced minor, then it contains a cycle of length at most~12 or a theta as an induced subgraph. With a longer and more technical proof, we prove that if a…

We show that if G is a connected bridgeless cubic graph whose every 2-factor is comprised of cycles of length five then G is the Petersen graph.