Daniel R. Hawtin

According to our database, Daniel R. Hawtin authored at least 12 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

A characterisation of edge-affine 2-arc-transitive covers of K2n,2n.

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

J. Comb. Theory, Ser. A, 2024

Neighbour-transitive codes in Kneser graphs.

Dean Crnkovic, Daniel R. Hawtin, Nina Mostarac, Andrea Svob

J. Comb. Theory, Ser. A, 2024

Group actions on codes in graphs.

Daniel R. Hawtin, Cheryl E. Praeger

CoRR, 2024

2023

On the classification of binary completely transitive codes with almost-simple top-group.

Robert F. Bailey, Daniel R. Hawtin

Eur. J. Comb., 2023

2022

Neighbour-transitive codes and partial spreads in generalised quadrangles.

Dean Crnkovic, Daniel R. Hawtin, Andrea Svob

Des. Codes Cryptogr., 2022

2021

s-Elusive codes in Hamming graphs.

Daniel R. Hawtin

Des. Codes Cryptogr., 2021

2020

Minimal binary 2-neighbour-transitive codes.

Daniel R. Hawtin, Cheryl E. Praeger

J. Comb. Theory A, 2020

2-Neighbour-Transitive Codes with Small Blocks of Imprimitivity.

Neil I. Gillespie, Daniel R. Hawtin, Cheryl E. Praeger

Electron. J. Comb., 2020

On the 486-Vertex Distance-Regular Graphs of Koolen-Riebeek and Soicher.

Robert F. Bailey, Daniel R. Hawtin

Electron. J. Comb., 2020

2018

Alphabet-almost-simple 2-neighbour-transitive codes.

Neil I. Gillespie, Daniel R. Hawtin

Ars Math. Contemp., 2018

2016

Entry-faithful 2-neighbour transitive codes.

Neil I. Gillespie, Michael Giudici, Daniel R. Hawtin, Cheryl E. Praeger

Des. Codes Cryptogr., 2016

2012

Elusive Codes in Hamming Graphs

Daniel R. Hawtin, Neil I. Gillespie, Cheryl E. Praeger

CoRR, 2012