Daniel R. Hawtin

most citedThe circular altitude of a graph

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

collaborators

Showing 2016Show all

2 papers · 1 filter

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…