Related papers: On Cayley digraphs that do not have hamiltonian pa…

Let G be a finitely presented group, and G' its commutator subgroup. Let C be the Cayley graph of G' with all commutators in G as generators. Then C is large scale simply connected. Furthermore, if G is a torsion-free nonelementary…

The relative Cayley graph of a group $G$ with respect to its proper subgroup $H$, is a graph whose vertices are elements of $G$ and two vertices $h\in H$ and $g\in G$ are adjacent if $g=hc$ for some $c\in C$, where $C$ is an inversed-closed…

A well-known conjecture of Alspach says that every $2k$-regular Cayley graph of an abelian group can be decomposed into Hamiltonian cycles. We consider an analogous question for infinite abelian groups. In this setting one natural analogue…

In this note, we prove that every 4-connected optimal 2-planar graph is Hamiltonian-connected. Furthermore, we show that the 4-connectedness condition is sharp by constructing infinitely many 3-connected optimal 2-planar graphs that are…

We give a new proof of a theorem of D. Calegari that says that the Cayley graph of a surface group with respect to any generating set lying in finitely many mapping class group orbits has infinite diameter. This applies, for instance, to…

A Cayley graph for a group $G$ is CCA if every automorphism of the graph that preserves the edge-orbits under the regular representation of $G$ is an element of the normaliser of $G$. A group $G$ is then said to be CCA if every connected…

For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

A graph $G$ is hypohamiltonian if $G$ is non-hamiltonian and $G - v$ is hamiltonian for every $v \in V(G)$. In the following, every graph is assumed to be hypohamiltonian. Aldred, Wormald, and McKay gave a list of all graphs of order at…

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…

It is known that the automorphism group of the elementary abelian $2$-group $Z_2^n$ is isomorphic to the general linear group $GL(n,F_2)$ of degree $n$ over $F_2$. Let $W$ be the collection of permutation matrices of order $n$. It is clear…

A family $\mathcal{F}$ of graphs is a \textit{Gallai family} if for every connected graph $G\in \mathcal{F}$, all longest paths in $G$ have a common vertex. While it is not known whether $P_5$-free graphs are a Gallai family, Long Jr.,…

A finite group $G$ is called a DCI-group if two Cayley digraphs over $G$ are isomorphic if and only if their connection sets are conjugate by a group automorphism. We prove that the group $C_4\times C_p^2$, where $p$ is a prime, is a…

We show that there exists an infinite family of cubic $2$-connected non-hamiltonian graphs with girth $5$ containing a unique longest cycle.

In this note we show that there is a cubic graph of girth $5$ that is not a subgraph of any minimal Cayley graph. On the other hand, we show that any Generalized Petersen Graph $G(n,k)$ with $\gcd(n,k)=1$ is an induced subgraph of a minimal…

Let $s$ be a positive integer. Our goal is to find all finite abelian groups $G$ that contain a $2$-subset $A$ for which the undirected Cayley graph $\Gamma(G,A)$ has diameter at most $s$. We provide a complete answer when $G$ is cyclic,…

For each $t \ge 1$ let $W_t$ denote the class of graphs other than stars that have diameter $2$ and contain neither a triangle nor a $K_{2,t}$. The famous Hoffman--Singleton Theorem implies that $W_2$ is finite. Recently Wood suggested the…

Two $a{-}b$ paths in a graph $G$ are order-compatible if their common vertices occur in the same order when travelling from $a$ to $b$. Suppose a graph contains an infinite number $\delta$ of edge-disjoint $a{-}b$ paths. G.A. Dirac asked…

A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley…

A finite group R is a CI-group if, whenever S and T are subsets of R with the Cayley graphs Cay(R,S) and Cay(R,T) isomorphic, there exists an automorphism x of R with S^x=T. The classification of CI-groups is an open problem in the theory…