1 citations · 2 across the 10 of their papers we have counts for
3 papers · 1 filter
Enumerating Hamiltonian Paths and Cycles
Harry Hylock, Karl Michael Schmidt, Matthew C. Lettington
We prove counting formulae for the number of directed Hamiltonian paths and directed Hamiltonian cycles in any complete multipartite graph. The method is based on a collapsing tech…
On c-polynomial factorisations
Harry G. Hylock, Harry Hylock, Matthew C. Lettington +1
c-Polynomials are polynomials whose (non-zero) coefficients are all equal to 1. Taking a theorem by Carlitz and Moser as a motivation, we prove a structure theorem for the factoris…
On Block Representations and Spectral Properties of Semimagic Square Matrices
S. L. Hill, M. C. Lettington, K. M. Schmidt
Using the decomposition of semimagic squares into the associated and balanced symmetry types as a motivation, we introduce an equivalent representation in terms of block-structured…