Share This Author
Practical graph isomorphism, II
- B. McKay, A. Piperno
- Computer ScienceJ. Symb. Comput.
- 8 January 2013
Isomorph-Free Exhaustive Generation
- B. McKay
- MathematicsJ. Algorithms
- 1 February 1998
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construction process exists.…
Constructing cospectral graphs
Some new constructions for families of cospectral graphs are derived, and some old ones are considerably generalized. One of our new constructions is sufficiently powerful to produce an estimated 72%…
The expected eigenvalue distribution of a large regular graph
- B. McKay
- Mathematics
- 1 October 1981
Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2)
- B. McKay, N. Wormald
- MathematicsComb.
- 1 December 1991
TLDR
Uniform Generation of Random Regular Graphs of Moderate Degree
- B. McKay, N. Wormald
- MathematicsJ. Algorithms
- 1 February 1990
The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges
- E. Bender, E. R. Canfield, B. McKay
- MathematicsRandom Struct. Algorithms
- 1 June 1990
Let c(n, q) be the number of connected labeled graphs with n vertices and q ≤ N = (2n) edges. Let x = q/n and k = q − n. We determine functions wk ˜ 1. a(x) and φ(x) such that c(n, q) ˜…
Small latin squares, quasigroups, and loops
- B. McKay, A. Meynert, W. Myrvold
- Mathematics
- 1 March 2007
We present the numbers of isotopy classes and main classes of Latin squares, and the numbers of isomorphism classes of quasigroups and loops, up to order 10. The best previous results were for Latin…
...
...