Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Adrian M. Nelson is active.

Publication


Featured researches published by Adrian M. Nelson.


Discrete Mathematics | 2010

GBRDs over groups of orders ≤100 or of order p q with p, q primes

R. Julian R. Abel; Diana Combe; Adrian M. Nelson; William D. Palmer

There are well-known necessary conditions for the existence of a generalized Bhaskar Rao design over a group G, with block size k=3. It has been conjectured that these necessary conditions are indeed sufficient. We prove that they are sufficient for groups G of order pq where p,q are primes and for groups of all orders @?100 except possibly 32, 36, 48, 54, 60, 64, 72, 96.


Designs, Codes and Cryptography | 2013

GBRDs over supersolvable groups and solvable groups of order prime to 3

R. Julian R. Abel; Diana Combe; Adrian M. Nelson; William D. Palmer

We show that the established necessary conditions for a GBRD


Advances in Mathematics | 1990

A generalized cyclotomic identity

Adrian M. Nelson


Discrete Mathematics | 2017

Block designs signed over groups of order 2n3m

R. Julian R. Abel; Diana Combe; Adrian M. Nelson; William D. Palmer

{(v,3,\lambda; \mathbb {G})}


Finite Fields and Their Applications | 2009

On completing three cyclically generated transversals to a latin square

Nicholas J. Cavenagh; Carlo Hamalainen; Adrian M. Nelson


Australasian J. Combinatorics | 2004

Magic labellings of graphs over finite abelian groups.

Diana Combe; Adrian M. Nelson; William D. Palmer

are sufficient (i) when


Electronic Journal of Combinatorics | 2006

Edge-Magic Group Labellings of Countable Graphs

Nicholas J. Cavenagh; Diana Combe; Adrian M. Nelson


Electronic Journal of Combinatorics | 2011

GBRDs with block size three over 2-groups, semi-dihedral groups and nilpotent groups

R. Julian R. Abel; Diana Combe; Adrian M. Nelson; William D. Palmer

{\mathbb {G}}


Australasian J. Combinatorics | 2006

Magic labellings of infinite graphs over infinite groups

Adrian M. Nelson; Diana Combe


Australasian J. Combinatorics | 2012

GBRDs with block size 3 over odd order groups and groups of orders divisible by 2 but not 4

R. Julian; R. Abel; Diana Combe; Adrian M. Nelson; William D. Palmer

is supersolvable and (ii) when

Collaboration


Dive into the Adrian M. Nelson's collaboration.

Top Co-Authors

Avatar

Diana Combe

University of New South Wales

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

R. Julian R. Abel

University of New South Wales

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

R. Abel

University of New South Wales

View shared research outputs
Top Co-Authors

Avatar

R. Julian

University of New South Wales

View shared research outputs
Researchain Logo
Decentralizing Knowledge