Daniel R. Hawtin

activity

20142022

most citedThe circular altitude of a graph

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2022

A characterisation of edge-affine $2$ -arc-transitive covers of $\K_{2^n,2^n}$

Daniel R. Hawtin, Cheryl E. Praeger, Jin-Xin Zhou

We introduce the notion of an \emph{ $n$ -dimensional mixed dihedral group}, a general class of groups for which we give a graph theoretic characterisation. In particular, if $H$ is…

math.CO2016

Alphabet-Almost-Simple 2-Neighbour Transitive Codes

Neil I. Gillespie, Daniel R. Hawtin

Let $X$ be a subgroup of the full automorphism group of the Hamming graph $H (m, q)$ , and $C$ a subset of the vertices of the Hamming graph. We say that $C$ is an \emph{ $(X, 2)$ -neigh…

math.CO2016★ 1 cited

The circular altitude of a graph

John Bamberg, Brian Corr, Alice Devillers +3

In this paper we investigate a parameter of graphs, called the circular altitude, introduced by Peter Cameron. We show that the circular altitude provides a lower bound on the circ…

math.CO2014

Entry-Faithful $2$ -Neighbour Transitive Codes

Neil I. Gillespie, Michael Giudici, Daniel R. Hawtin +1

We consider a code to be a subset of the vertex set of a Hamming graph. The set of $s$ -neighbours of a code is the set of vertices, not in the code, at distance $s$ from some codew…

A characterisation of edge-affine 2-arc-transitive covers of $\K_{2^n,2^n}$

Alphabet-Almost-Simple 2-Neighbour Transitive Codes

The circular altitude of a graph

Entry-Faithful 2-Neighbour Transitive Codes

A characterisation of edge-affine $2$ -arc-transitive covers of $\K_{2^n,2^n}$

Entry-Faithful $2$ -Neighbour Transitive Codes