Brendan McKay
#17,149
Most Influential Person Now
Mathematician and Computer Scientist
Brendan McKay 's AcademicInfluence.com Rankings
Brendan McKay mathematics Degrees
Mathematics
#1030
World Rank
#1765
Historical Rank
Measure Theory
#1547
World Rank
#1921
Historical Rank
Brendan McKay computer-science Degrees
Computer Science
#2714
World Rank
#2840
Historical Rank
Algorithms
#187
World Rank
#190
Historical Rank
Machine Learning
#2423
World Rank
#2453
Historical Rank
Download Badge
Mathematics Computer Science
Brendan McKay 's Degrees
- PhD Mathematics University of California, Berkeley
- Masters Computer Science Stanford University
Similar Degrees You Can Earn
Why Is Brendan McKay Influential?
(Suggest an Edit or Addition)According to Wikipedia, Brendan Damien McKay is an Australian computer scientist and mathematician. He is currently an Emeritus Professor in the Research School of Computer Science at the Australian National University . He has published extensively in combinatorics.
Brendan McKay 's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Practical graph isomorphism, II (2013) (1372)
- Isomorph-Free Exhaustive Generation (1998) (482)
- nauty User ’ s Guide ( Version 2 . 4 ) (1990) (443)
- The expected eigenvalue distribution of a large regular graph (1981) (365)
- Constructing cospectral graphs (1982) (242)
- Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2) (1991) (213)
- A new graph product and its spectrum (1978) (178)
- On the Number of Latin Squares (2005) (178)
- Fast generation of planar graphs (2007) (165)
- Uniform Generation of Random Regular Graphs of Moderate Degree (1990) (165)
- Small latin squares, quasigroups, and loops (2007) (163)
- Asymptotic Enumeration by Degree Sequence of Graphs of High Degree (1990) (130)
- Feasibility conditions for the existence of walk-regular graphs (1980) (127)
- Short Cycles in Random Regular Graphs (2004) (118)
- A Note on Large Graphs of Diameter Two and Given Maximum Degree, (1998) (107)
- Constant Time Generation of Free Trees (1986) (104)
- The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges (1990) (96)
- Posets on up to 16 Points (2002) (91)
- Generation of simple quadrangulations of the sphere (2005) (90)
- On an edge crossing problem (1986) (87)
- Subgraphs of random graphs with specified degrees (2011) (86)
- Spanning Trees in Regular Graphs (1983) (85)
- Vertex-transitive graphs which are not Cayley graphs, I (1994) (78)
- Hamiltonian cycles in cubic 3-connected bipartite planar graphs (1985) (76)
- Kochen-Specker Vectors (2004) (73)
- Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums (2006) (73)
- Small graphs are reconstructible (1997) (70)
- The number of transversals in a Latin square (2006) (70)
- The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices (1988) (69)
- Latin Squares of Order 10 (1995) (68)
- A Census of Small Latin Hypercubes (2008) (67)
- An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property (1984) (66)
- Subgraph Counting Identities and Ramsey Numbers (1997) (62)
- The value of the Ramsey number r(3, 8) (1992) (59)
- Asymptotic enumeration of Latin rectangles (1990) (58)
- The number of matchings in random regular graphs and bipartite graphs (1986) (57)
- Computing automorphisms and canonical labellings of graphs (1978) (57)
- There are 526,915,620 nonisomorphic one‐factorizations of K12 (1994) (56)
- Transitive graphs with fewer than twenty vertices (1979) (56)
- The Generation of Fullerenes (2012) (55)
- Generation of Cubic graphs (2011) (55)
- Classification of regular two-graphs on 36 and 38 vertices (2001) (53)
- Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums (2005) (52)
- The asymptotic volume of the Birkhoff polytope (2007) (52)
- The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs (1990) (51)
- Acyclic Digraphs and Eigenvalues of O,1 Matrices (2003) (51)
- Spectral conditions for the reconstructibility of a graph (1981) (50)
- Asymptotic enumeration of dense 0-1 matrices with specified line sums (2006) (49)
- The degree sequence of a random graph. I. The models (1997) (48)
- The Transitive Graphs with at Most 26 Vertices (1990) (47)
- Graceful and harmonious labellings of trees (1998) (47)
- The Smallest Cubic Graphs of Girth Nine (1995) (46)
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums (2007) (46)
- Vertex-transitive graphs that are not Cayley graphs. II (1996) (44)
- Graph Isomorphism (2008) (42)
- A nine point theorem for 3-connected graphs (1982) (42)
- Algorithms for Greechie Diagrams (2000) (41)
- TrExML: a maximum-likelihood approach for extensive tree-space exploration (2000) (41)
- On Littlewood's estimate for the binomial distribution (1989) (41)
- Most Latin Squares Have Many Subsquares (1999) (40)
- Nonhamiltonian 3-Connected Cubic Planar Graphs (2000) (40)
- Asymptotic enumeration of 0–1 matrices with equal row sums and equal column sums (2003) (40)
- Construction of planar triangulations with minimum degree 5 (2005) (40)
- Some computational results on the spectra of graphs (1976) (39)
- Hadamard equivalence via graph isomorphism (1979) (39)
- Collective Choice and Mutual Knowledge Structures (1998) (39)
- autoson – a distributed batch system for UNIX workstation networks (version 1.3) (1996) (39)
- Solving the Bible Code Puzzle (1999) (39)
- The exponent set of symmetric primitive (0, 1) matrices with zero trace (1990) (37)
- R(4, 5) = 25 (1995) (37)
- Asymptotic Enumeration of Eulerian Circuits in the Complete Graph (1998) (34)
- Determinants and ranks of random matrices over Zm (1987) (34)
- Automorphisms of random graphs with specified vertices (1984) (34)
- Practical graph isomorphism, Numerical mathematics and computing, Proc. 10th Manitoba Conf., Winnipeg/Manitoba 1980 (1981) (33)
- Fast backtracking principles applied to find new cages (1998) (33)
- Subgraphs of Dense Random Graphs with Specified Degrees (2010) (33)
- A universal set of growth operations for fullerenes (2008) (32)
- The first classical Ramsey number for hypergraphs is computed (1991) (29)
- The Distributions of the Entries of Young Tableaux (2000) (29)
- THE DIMENSION OF A GRAPH (1980) (28)
- Asymptotic Properties of Labeled Connected Graphs (1992) (28)
- Complex martingales and asymptotic enumeration (2016) (26)
- R(5,5)≤48 (2018) (24)
- Asymptotic enumeration of integer matrices with large equal row and column sums (2010) (24)
- Planar Hypohamiltonian Graphs on 40 Vertices (2013) (24)
- The average number of spanning trees in sparse graphs with given degrees (2016) (24)
- APPLICATIONS OF A TECHNIQUE FOR LABELLED ENUMERATION (1983) (23)
- The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices (1997) (22)
- Small hypohamiltonian graphs (1997) (22)
- Products of graphs and their spectra (1976) (21)
- Symmetric drawings of triconnected planar graphs (2002) (21)
- Graph approach to quantum systems (2010) (20)
- The probability of collective choice with shared knowledge structures (2002) (20)
- The Iteration Number of Colour Refinement (2020) (20)
- Counting unlabelled topologies and transitive relations (2005) (19)
- Maximising the Permanent of (0, 1)-Matrices and the Number of Extensions of Latin Rectangles (1998) (18)
- Computer reconstruction of small graphs (1977) (18)
- Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs (1999) (18)
- On Ryser's conjecture for linear intersecting multipartite hypergraphs (2015) (18)
- Random dense bipartite graphs and directed graphs with specified degrees (2007) (18)
- A new upper bound on the Ramsey number R(5, 5) (1992) (17)
- The Order of Automorphisms of Quasigroups (2015) (17)
- Asymptotic Enumeration of Tournaments with a Given Score Sequence (1996) (16)
- Sandwiching random regular graphs between binomial random graphs (2019) (16)
- The smallest fullerene without a spiral (2012) (16)
- Competition Numbers, Quasi-line Graphs, and Holes (2011) (16)
- On the shape of a random acyclic digraph (1989) (16)
- Knight's tours of an 8 x 8 chessboard (1997) (15)
- Recursive generation of IPR fullerenes (2015) (15)
- Asymptotic enumeration of contingency tables with constant margins (2007) (14)
- Linear Programming in Some Ramsey Problems (1994) (14)
- Asymptotic Enumeration of Sparse Multigraphs with Given Degrees (2013) (14)
- Multicolored Trees in Random Graphs (1994) (14)
- Recursive generation of simple planar 5-regular graphs and pentangulations (2011) (13)
- Computational determination of (3, 11) and (4, 7) cages (2010) (13)
- The spectrum of a graph (1977) (13)
- An Inequality for Walks in a Graph (1983) (12)
- Asymptotic enumeration of integer matrices with constant row and column sums (2007) (11)
- Degree sequences of random digraphs and bipartite graphs (2013) (11)
- Uniform generation of random Latin rectangles (1991) (11)
- Graphs with regular neighbourhoods (1980) (10)
- Backtrack search and look-ahead for the construction of planar cubic graphs with restricted face sizes (2003) (10)
- Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph (2000) (10)
- Rectangular-radial drawings of cubic plane graphs (2010) (9)
- Combinatorial estimates by the switching method (2010) (9)
- Asymptotic enumeration of correlation-immune boolean functions (2009) (9)
- Circular designs balanced for neighbours at distances one and two (2014) (9)
- On Subgraph Sizes in Random Graphs (1992) (9)
- ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS (2011) (8)
- A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability (1980) (8)
- The asymptotic number of claw-free cubic graphs (2003) (8)
- A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs (2006) (8)
- Graph structural properties of non-Yutsis graphs allowing fast recognition (2009) (7)
- A Note on the History of the Four‐Colour Conjecture (2012) (7)
- A generalized switching method for combinatorial estimation (2007) (7)
- Hypohamiltonian Planar Cubic Graphs with Girth 5 (2017) (7)
- Towards deciding the existance of 2-(22,8,4) designs (1996) (7)
- The Nonexistence of 4-(12,6,6) Designs (1996) (7)
- The Torah Codes: Puzzle and Solution (1998) (7)
- Generating function methods for macromolecules at surfaces. I. One molecule at a plane surface (1986) (7)
- Fast generation of some classes of planar graphs (1999) (6)
- 2-(22, 8, 4) Designs have no blocks of type 3 (1999) (6)
- To be or not to be Yutsis: Algorithms for the decision problem (2005) (6)
- Asymptotic enumeration of linear hypergraphs with given number of vertices and edges (2019) (6)
- A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks (2018) (6)
- Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4 (2010) (6)
- Subgraphs of Random k-Edge-Coloured k-Regular Graphs (2009) (6)
- On determinants of random symmetric matrices over Z_m (2010) (6)
- 3-Perfect hamiltonian decomposition of the complete graph (2013) (5)
- Asymptotic Enumeration of Graphs with a Given Upper Bound on the Maximum Degree (2002) (5)
- Topological Repair on Voxel-Based Quadrangular Meshes (2006) (5)
- Ramsey Numbers for Triangles versus Almost-Complete Graphs (2004) (5)
- On a bound of Hoeffding in the complex case (2016) (5)
- Transposable and symmetrizable matrices (1980) (5)
- Subgraph counts for dense random graphs with specified degrees (2018) (4)
- Fullerenes with distant pentagons (2015) (4)
- Equidistant Letter Sequences in Tolstoy's "War and Peace" (1999) (4)
- Determinants of matrices of the conference type (1997) (4)
- NC Algorithms for Dynamically Solving the all Pairs Shortest Paths Problem and Related Problems (1996) (4)
- Black 1-factors and Dudeney sets (2010) (3)
- Isomorph-Free Exhaustive Generation of Greechie Diagrams and Automated Checking of Their Passage by Orthomodular Lattice Equations (2000) (3)
- A class of Ramsey-extremal hypergraphs (2016) (3)
- Asymptotic enumeration of non-uniform linear hypergraphs (2022) (3)
- Recursive Generation of 5-Regular Planar Graphs (2009) (3)
- Counting loopy graphs with given degrees (2011) (3)
- ANGELTVEIT and MCKAY - Angeltveit - 2018 - Journal of Graph Theory - Wiley Online Library (2018) (3)
- Generating function methods for macromolecules at surfaces. II. One molecule between two planes (1988) (3)
- Fast fully dynamic labelling for distance queries (2021) (3)
- Enumeration of Latin squares with conjugate symmetry (2021) (3)
- Surge: a fast open-source chemical graph generator (2021) (3)
- The current status of the generalised moore graph problem (1979) (3)
- Cubic Neighbourhoods in Triple Systems (1987) (3)
- On the non-existence of odd degree graphs of diameter 2 and defect 2 (2008) (2)
- Sandwiching dense random regular graphs between binomial random graphs (2022) (2)
- Spherical-Rectangular Drawings (2009) (2)
- The asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edges (1992) (2)
- Computational Issues for Cross-over Designs Subject to Dropout (1994) (2)
- Fast parallel algorithms for testing k-connectivity of directed and undirected graphs (1995) (2)
- Switching Reconstruction of Digraphs (2013) (2)
- Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs (2018) (2)
- [2] Dudeney's round Table Problem and Neighbour-balanced Hamilton Decompositions (2014) (1)
- The Minimality of the Georges-Kelmans Graph (2021) (1)
- Integer sequences with proscribed differences and bounded growth rate (1985) (1)
- [2] Dudeney's round Table Problem and Neighbour-balanced Hamilton Decompositions (2014) (1)
- A Conjecture of Erdős the Ramsey Number r ( W 6 ) (1996) (1)
- Paths through equally spaced points on a circle (2022) (1)
- Asymptotic Enumeration of Orientations of a Graph as a Function of the Out-Degree Sequence (2019) (1)
- A Faster Test for 4-Flow-Criticality in Snarks (2015) (1)
- Bipartite edge partitions and the former Alon-Saks-Seymour conjecture (2016) (1)
- Hypohamiltonian planar cubic graphs with girth five (2015) (1)
- Selected Papers in Combinatorics: A Volume Dedicated to R.G. Stanton (1992) (1)
- Parallel integer sorting (1995) (1)
- Factorisation of the complete graph into spanning regular factors (2022) (1)
- Kochen-Specker Qubits (2004) (0)
- The asymptotic number of graphs with a restriction on the maximum degree (2000) (0)
- THERE ARE 2834 SPREADS OF LINES IN PG(3, 8) (2014) (0)
- Reconstruction of small graphs and tournaments (2021) (0)
- Degree sequences of sufficiently dense random uniform hypergraphs (2021) (0)
- Section 2.2 Graph Isomorphism (2015) (0)
- Graph Isomorphism and the Lasserre Hierarchy (2014) (0)
- The r-switching-stable graphs (2019) (0)
- Ralph Gordon Stanton (1991) (0)
- 2 2 6 D ec 2 00 4 Kochen-Specker Vectors (2005) (0)
- Design of an automated radiator panel rotating machine : final design report (2012) (0)
- Factorisation of the Complete Bipartite Graph into Spanning Semiregular Factors (2022) (0)
- An NC approximation algorithm for optimal k-edge connectivity augmentation (1999) (0)
- Computing Symmetries of Combinatorial Objects (2007) (0)
- ec 2 00 4 Kochen-Specker Vectors (2006) (0)
- x~~te~ce of -Regular Graphs (1980) (0)
- Reconstruction of small graphs and digraphs (2021) (0)
This paper list is powered by the following services:
Other Resources About Brendan McKay
What Schools Are Affiliated With Brendan McKay ?
Brendan McKay is affiliated with the following schools:
