Follow
Brendan McKay
Brendan McKay
Professor of Computer Science, Australian National University
Verified email at anu.edu.au
Title
Cited by
Cited by
Year
Practical graph isomorphism
BD McKay
Department of Computer Science, Vanderbilt University 30, 45-87, 1981
15911981
Practical graph isomorphism, II
BD McKay, A Piperno
Journal of symbolic computation 60, 94-112, 2014
13002014
Isomorph-free exhaustive generation
BD McKay
Journal of Algorithms 26 (2), 306-324, 1998
6071998
The expected eigenvalue distribution of a large regular graph
BD McKay
Linear Algebra and its Applications 40, 203-216, 1981
4161981
Constructing cospectral graphs
CD Godsil, BD McKay
Aequationes Mathematicae 25 (1), 257-268, 1982
2771982
Asymptotic enumeration by degree sequence of graphs with degreeso (n 1/2)
BD McKay, NC Wormald
Combinatorica 11 (4), 369-382, 1991
2431991
On the number of Latin squares
BD McKay, IM Wanless
Annals of combinatorics 9 (3), 335-344, 2005
2252005
Small Latin squares, quasigroups, and loops
BD McKay, A Meynert, W Myrvold
Journal of Combinatorial Designs 15 (2), 98-119, 2007
2202007
A new graph product and its spectrum
CD Godsil, BD McKay
Bulletin of the Australian Mathematical Society 18 (1), 21-28, 1978
2151978
Uniform generation of random regular graphs of moderate degree
BD McKay, NC Wormald
Journal of Algorithms 11 (1), 52-67, 1990
2031990
Fast generation of planar graphs
G Brinkmann, BD McKay
MATCH Commun. Math. Comput. Chem 58 (2), 323-357, 2007
1902007
Asymptotics for symmetric 0-1 matrices with prescribed row sums
BD McKay
Ars Combin 19, 15-25, 1985
1841985
Nauty user’s guide
BD McKay
1681990
Feasibility conditions for the existence of walk-regular graphs
CD Godsil, BD McKay
Linear algebra and its applications 30, 51-61, 1980
1551980
Nauty user’s guide (version 2.4)
BD McKay
Computer Science Dept., Australian National University, 225-239, 2007
1512007
Constant time generation of free trees
RA Wright, B Richmond, A Odlyzko, BD McKay
SIAM Journal on Computing 15 (2), 540-548, 1986
1441986
Asymptotic enumeration by degree sequence of graphs of high degree
BD McKay, NC Wormald
European Journal of Combinatorics 11 (6), 565-580, 1990
1411990
A note on large graphs of diameter two and given maximum degree
BD McKay, M Miller, J Širáň
Journal of Combinatorial Theory, Series B 74 (1), 110-118, 1998
1311998
On the spectral characterisation of trees
BD McKay
Ars Combin 3, 219-232, 1977
1311977
R(4, 5) = 25
BD McKay, SP Radziszowski
Journal of Graph Theory 19 (3), 309-322, 1995
1271995
The system can't perform the operation now. Try again later.
Articles 1–20