- Home
- Best Scientists - Mathematics
- Brendan D. McKay

Mathematics

Australia

2022

Computer Science

Australia

2023

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
55
Citations
9,572
221
World Ranking
587
National Ranking
13

Computer Science
D-index
55
Citations
9,568
220
World Ranking
2916
National Ranking
70

2023 - Research.com Computer Science in Australia Leader Award

2022 - Research.com Mathematics in Australia Leader Award

- Combinatorics
- Discrete mathematics
- Geometry

His primary areas of investigation include Discrete mathematics, Combinatorics, Chordal graph, Indifference graph and Random regular graph. His studies deal with areas such as Spectrum, Order and Degree as well as Discrete mathematics. His study explores the link between Degree and topics such as Strongly regular graph that cross with problems in Probability density function, Eigenvalue distribution, Sequence and Eigenvalues and eigenvectors.

His Combinatorics research is multidisciplinary, incorporating elements of Order and Symmetry group. In his study, Isomorphism is strongly linked to Quasigroup, which falls under the umbrella field of Symmetry group. He has included themes like 1-planar graph, Pathwidth and Split graph in his Indifference graph study.

- Practical graph isomorphism, II (1219 citations)
- Isomorph-Free Exhaustive Generation (428 citations)
- The expected eigenvalue distribution of a large regular graph (313 citations)

Brendan D. McKay focuses on Combinatorics, Discrete mathematics, Enumeration, Random graph and Bipartite graph. His research on Combinatorics frequently links to adjacent areas such as Order. He interconnects Isomorphism and Constant in the investigation of issues within Order.

While the research belongs to areas of Enumeration, Brendan D. McKay spends his time largely on the problem of Integer, intersecting his research to questions surrounding Bounded function and Diagonal. His work focuses on many connections between Random graph and other disciplines, such as Spanning tree, that overlap with his field of interest in Expected value. His Indifference graph research includes elements of Cograph and Pancyclic graph.

- Combinatorics (81.78%)
- Discrete mathematics (55.08%)
- Enumeration (11.86%)

- Combinatorics (81.78%)
- Graph (9.32%)
- Random graph (11.44%)

His scientific interests lie mostly in Combinatorics, Graph, Random graph, Enumeration and Ramsey's theorem. His work in Combinatorics addresses subjects such as Expected value, which are connected to disciplines such as Spanning tree. His Graph research also works with subjects such as

- Natural number that intertwine with fields like Order,
- Mathematical proof, which have a strong connection to Reconstruction conjecture, Equivalence, Unipotent and Idempotence.

His work in Random graph covers topics such as Exponential function which are related to areas like Truncated normal distribution and Rasch model. Brendan D. McKay has included themes like Maximum likelihood, Estimator and Asymptotic formula in his Enumeration study. His Ramsey's theorem research is multidisciplinary, relying on both Class and Graph theory.

- Planar Hypohamiltonian Graphs on 40 Vertices (19 citations)
- The average number of spanning trees in sparse graphs with given degrees (17 citations)
- On Ryser's conjecture for linear intersecting multipartite hypergraphs (15 citations)

- Combinatorics
- Algebra
- Geometry

Brendan D. McKay mostly deals with Combinatorics, Random graph, Graph, Discrete mathematics and Cover. His studies in Combinatorics integrate themes in fields like Rasch model and Truncated normal distribution. The concepts of his Random graph study are interwoven with issues in Expected value, Exponential function, Bipartite graph and Spanning tree.

His Graph research is multidisciplinary, incorporating elements of Natural number, Upper and lower bounds, Order and Subroutine. His work in Pancyclic graph, Grinberg's theorem, Polyhedral graph, Book embedding and Outerplanar graph is related to Discrete mathematics. His Cover research incorporates themes from Degree, Conjecture, Random minimum spanning tree, Giant component and Almost surely.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Practical graph isomorphism, II

Brendan D. Mckay;Adolfo Piperno.

Journal of Symbolic Computation **(2014)**

1376 Citations

Isomorph-Free Exhaustive Generation

Brendan D McKay.

Journal of Algorithms **(1998)**

616 Citations

The expected eigenvalue distribution of a large regular graph

Brendan D. McKay.

Linear Algebra and its Applications **(1981)**

417 Citations

Constructing cospectral graphs

C. D. Godsil;C. D. Godsil;B. D. McKay;B. D. McKay.

Aequationes Mathematicae **(1982)**

271 Citations

Asymptotic enumeration by degree sequence of graphs with degrees o(n1/2)

Brendan D. McKay;Nicholas C. Wormald.

Combinatorica **(1991)**

244 Citations

Small latin squares, quasigroups, and loops

Brendan D. McKay;Alison Meynert;Wendy Myrvold.

Journal of Combinatorial Designs **(2007)**

223 Citations

On the number of Latin squares

Brendan D McKay;Ian Murray Wanless;Ian Murray Wanless.

Annals of Combinatorics **(2005)**

222 Citations

Uniform generation of random regular graphs of moderate degree

Brendan D. McKay;Nicholas C. Wormald.

Journal of Algorithms **(1990)**

205 Citations

A new graph product and its spectrum

C.D. Godsil;B.D. McKay.

Bulletin of The Australian Mathematical Society **(1978)**

202 Citations

Fast generation of planar graphs

Gunnar Brinkmann;Brendan D McKay.

Match-communications in Mathematical and in Computer Chemistry **(2007)**

189 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Monash University

University of Waterloo

University of Pennsylvania

University of Sydney

Australian National University

MIT

Tel Aviv University

Australian National University

University of Western Australia

University of Memphis

Hong Kong Baptist University

Josai University

Stanford University

Hebrew University of Jerusalem

Complutense University of Madrid

University of Lorraine

Antoni van Leeuwenhoek Hospital

University of Sussex

University of Alberta

Children's Hospital of Eastern Switzerland St. Gallen

Ghent University

Purdue University West Lafayette

University of Manchester

RTI International

Tufts University

Something went wrong. Please try again later.