PhD Thesis
Hawtin, D. R., 2017, Algebraic symmetry of codes in Hamming graphs, Doctor of Philosophy, The University of Western Australia. DOI: 10.4225/23/5a5808f48f2d0
Pdf link.
Pdf link.
Research Papers
Hawtin, D.R., Zhou, J.X. and Praeger, C.E., 2023. A family of 2-groups and an associated family of semisymmetric, locally 2-arc-transitive graphs. Glasnik Matematicki. Available online.
Journal link. Preprint link.
Crnković, D., Hawtin, D.R., Mostarac, N. and Švob, A., 2023. Neighbour-transitive codes in Kneser graphs. Preprint.
Preprint link.
Bailey, R.F. and Hawtin, D.R., 2023. On the classification of binary completely transitive codes with almost-simple top-group. European Journal of Combinatorics, 107.
Journal link. Preprint link.
Hawtin, D.R., Praeger, C.E. and Zhou, J.X., 2023. Using mixed dihedral groups to construct normal Cayley graphs, and a new bipartite 2-arc-transitive graph which is not a Cayley graph. Preprint.
Preprint link.
Hawtin, D.R., Praeger, C.E. and Zhou, J.X., 2022. A characterisation of edge-affine 2-arc-transitive covers of $K_{2^n, 2^n}$. Preprint.
Preprint link.
Crnković, D., Hawtin, D.R. and Švob, A., 2022. Neighbour-transitive codes and partial spreads in generalised quadrangles. Designs, Codes and Cryptography, 90(6), pp.1521-1533.
Journal link. Preprint link.
Hawtin, D.R. and Lansdown, J., 2022. The Non-Existence of Block-Transitive Subspace Designs. Combinatorial Theory, 2(1).
Journal link. Preprint link.
Hawtin, D.R., 2021. s-Elusive codes in Hamming graphs. Designs, Codes and Cryptography, 89(6), pp.1211-1220.
Journal link. Preprint link.
Hawtin, D.R. and Praeger, C.E., 2020. Minimal binary 2-neighbour-transitive codes. Journal of Combinatorial Theory A, 171.
Journal link. Preprint link.
Bailey, R.F. and Hawtin, D.R., 2020. On the 486-vertex distance-regular graphs of Koolen--Riebeek and Soicher. The Electronic Journal of Combinatorics.
Journal link. Preprint link.
Gillespie, N. I., Hawtin, D. R. and Praeger, C. E., 2020. 2-Neighbour-transitive codes with small blocks of imprimitivity. The Electronic Journal of Combinatorics.
Journal link. Preprint link.
Bamberg, J., Devillers, A., Pivotto, I., Corr, B., Hawtin, D. R., and Swartz, E., 2018. The circular altitude of a graph. Australasian Journal of Combinatorics, 72(2), pp.357–368.
Journal link. Preprint link.
Gillespie, N. I. and Hawtin, D. R., 2017. Alphabet-almost-simple 2-neighbour-transitive codes. Ars Mathematica Contemporanea, 14(2), pp.345–357.
Journal link. Preprint link.
Gillespie, N. I., Giudici, M., Hawtin, D. R. and Praeger, C. E., 2016. Entry-faithful 2-neighbour transitive codes. Designs, Codes and Cryptography, 79(3), pp.549–564.
Journal link. Preprint link.
Hawtin, D. R., Gillespie, N. I. and Praeger, C. E., 2013. Elusive codes in Hamming graphs. Bulletin of the Australian Mathematical Society, 88(2), pp.286–296.
Journal link. Preprint link.
Journal link. Preprint link.
Crnković, D., Hawtin, D.R., Mostarac, N. and Švob, A., 2023. Neighbour-transitive codes in Kneser graphs. Preprint.
Preprint link.
Bailey, R.F. and Hawtin, D.R., 2023. On the classification of binary completely transitive codes with almost-simple top-group. European Journal of Combinatorics, 107.
Journal link. Preprint link.
Hawtin, D.R., Praeger, C.E. and Zhou, J.X., 2023. Using mixed dihedral groups to construct normal Cayley graphs, and a new bipartite 2-arc-transitive graph which is not a Cayley graph. Preprint.
Preprint link.
Hawtin, D.R., Praeger, C.E. and Zhou, J.X., 2022. A characterisation of edge-affine 2-arc-transitive covers of $K_{2^n, 2^n}$. Preprint.
Preprint link.
Crnković, D., Hawtin, D.R. and Švob, A., 2022. Neighbour-transitive codes and partial spreads in generalised quadrangles. Designs, Codes and Cryptography, 90(6), pp.1521-1533.
Journal link. Preprint link.
Hawtin, D.R. and Lansdown, J., 2022. The Non-Existence of Block-Transitive Subspace Designs. Combinatorial Theory, 2(1).
Journal link. Preprint link.
Hawtin, D.R., 2021. s-Elusive codes in Hamming graphs. Designs, Codes and Cryptography, 89(6), pp.1211-1220.
Journal link. Preprint link.
Hawtin, D.R. and Praeger, C.E., 2020. Minimal binary 2-neighbour-transitive codes. Journal of Combinatorial Theory A, 171.
Journal link. Preprint link.
Bailey, R.F. and Hawtin, D.R., 2020. On the 486-vertex distance-regular graphs of Koolen--Riebeek and Soicher. The Electronic Journal of Combinatorics.
Journal link. Preprint link.
Gillespie, N. I., Hawtin, D. R. and Praeger, C. E., 2020. 2-Neighbour-transitive codes with small blocks of imprimitivity. The Electronic Journal of Combinatorics.
Journal link. Preprint link.
Bamberg, J., Devillers, A., Pivotto, I., Corr, B., Hawtin, D. R., and Swartz, E., 2018. The circular altitude of a graph. Australasian Journal of Combinatorics, 72(2), pp.357–368.
Journal link. Preprint link.
Gillespie, N. I. and Hawtin, D. R., 2017. Alphabet-almost-simple 2-neighbour-transitive codes. Ars Mathematica Contemporanea, 14(2), pp.345–357.
Journal link. Preprint link.
Gillespie, N. I., Giudici, M., Hawtin, D. R. and Praeger, C. E., 2016. Entry-faithful 2-neighbour transitive codes. Designs, Codes and Cryptography, 79(3), pp.549–564.
Journal link. Preprint link.
Hawtin, D. R., Gillespie, N. I. and Praeger, C. E., 2013. Elusive codes in Hamming graphs. Bulletin of the Australian Mathematical Society, 88(2), pp.286–296.
Journal link. Preprint link.