Daniel R. Hawtin

activity

20122026

most citedThe circular altitude of a graph

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

collaborators

Showing 2024Show all

3 papers · 1 filter

math.CO2024

Alphabet-affine 2-neighbour-transitive codes

Daniel R. Hawtin

A code $C$ is a subset of the vertex set of a Hamming graph $H (n, q)$ , and $C$ is $2$ -neighbour-transitive if the automorphism group $G={\rm Aut}({\mathcal C})…

math.CO2024

Group actions on codes in graphs

Daniel R. Hawtin, Cheryl E. Praeger

This is a chapter in a forthcoming book on completely regular codes in distance regular graphs. The chapter provides an overview, and some original results, on codes in distance re…

math.CO2024

Transitive $(q - 1)$ -fold packings of $PG_{n} (q)$

Daniel R. Hawtin

A $t$ -fold packing of a projective space $PG_{n} (q)$ is a collection $P$ of line-spreads such that each line of $PG_{n} (q)$ occurs in precisely $t$ spreads in $\mat…

Alphabet-affine 2-neighbour-transitive codes

Group actions on codes in graphs

Transitive (q−1)-fold packings of PGn​(q)

Transitive $(q - 1)$ -fold packings of $PG_{n} (q)$