In mathematics, the McKay graph of a finite-dimensional representation V of a finite group G is a weighted quiver encoding the structure of the representation...

In graph theory, the McKay–Miller–Širáň graphs are an infinite class of vertex-transitive graphs with diameter two, and with a large number of vertices...

Neolithic Scots to John McKay le Bruyn, Lieven (22 April 2009), the monster graph and McKay's observation Kostant, Bertram (1995), "The Graph of the Truncated...

In graph theory, a wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle. A wheel graph with n vertices can...

In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it...

Brendan McKay and Nicholas Wormald. Béla Bollobás, Random Graphs, 2nd edition, Cambridge University Press (2001), section 2.4: Random Regular Graphs Bollobás...

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect...

Faulkner and Younger published two more graphs – the Faulkner–Younger graphs on 42 and 44 vertices. Finally Holton and McKay showed there are exactly six 38-vertex...

species CH3F+ and CH3BF2+ which both contain a single unpaired electron. McKay graph ADE classification Molecular symmetry Point group Space group In his...

Delorme & Farhi (1982). McKay–Miller–Širáň graphs found by McKay, Miller & Širáň (1998). Graph found by Vlad Pelakhaty in 2021. Graphs found by Gómez, Fiol...

in 2000. McKay is the author of at least 127 refereed articles. One of McKay's main contributions has been a practical algorithm for the graph isomorphism...

In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices)...

McKay (1988). The condition that the graph be 3-regular is necessary due to polyhedra such as the rhombic dodecahedron, which forms a bipartite graph...

In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether...

In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving...

In mathematics, and, in particular, in graph theory, a rooted graph is a graph in which one vertex has been distinguished as the root. Both directed and...

mathematical field of graph theory, a graph G is said to be hypohamiltonian if G itself does not have a Hamiltonian cycle but every graph formed by removing...

In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every...

graphs was obtained by Babai & Codenotti (2008). There are several competing practical algorithms for graph isomorphism, such as those due to McKay (1981)...

In mathematical graph theory, the rooted product of a graph G and a rooted graph H is defined as follows: take |V(G)| copies of H, and for every vertex...

Mike Gregory, English darts player (b. 1956). John McKay, mathematician (McKay conjecture, McKay graph) (b. 1939). Henry Scott-Stokes, journalist (Financial...

its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently large complete graph. To...

for all graphs with at most 13 vertices by Brendan McKay. In a probabilistic sense, it has been shown by Béla Bollobás that almost all graphs are reconstructible...

and in fact (in a result due to Brendan McKay) by 4 n D {\textstyle {\frac {4}{nD}}} . For the example graph with 6 nodes show above ( n = 6 , D = 3 {\textstyle...

of graph theory, the Hoffman–Singleton graph is a 7-regular undirected graph with 50 vertices and 175 edges. It is the unique strongly regular graph with...

Olympic bronze medallist (1956). John McKay, 82, British-Canadian mathematician (McKay conjecture, McKay graph). Ardina Moore, 91, American Quapaw-Osage...

non-Hamiltonian polyhedral graphs are possible, including the Goldner–Harary graph and the Herschel graph. Holton, D. A.; McKay, B. D. (1988), "The smallest...

In graph theory, a strongly regular graph (SRG) is a regular graph G = (V, E) with v vertices and degree k such that for some given integers λ , μ ≥ 0...

Aldred, R. E. L.; Bau, S.; Holton, D. A.; McKay, Brendan D. (2000), "Nonhamiltonian 3-connected cubic planar graphs", SIAM Journal on Discrete Mathematics...

graceful labeling? More unsolved problems in mathematics In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some...