Moore Graph

In graph theory, a Moore graph is a regular graph of degree d and diameter k whose number of vertices equals the upper bound

An equivalent definition of a Moore graph is that it is a graph of diameter k with girth 2k + 1. Moore graphs were named by Hoffman & Singleton (1960) after Edward F. Moore, who posed the question of describing and classifying these graphs.

As well as having the maximum possible number of vertices for a given combination of degree and diameter, Moore graphs have the minimum possible number of vertices for a regular graph with given degree and girth. That is, any Moore graph is a cage (Erdõs, Rényi & Sós 1966). The formula for the number of vertices in a Moore graph can be generalized to allow a definition of Moore graphs with even girth as well as odd girth, and again these graphs are cages.

Read more about Moore GraphBounding Vertices By Degree and Diameter, Moore Graphs As Cages, Examples

Other articles related to "moore graph, moore graphs, graphs, graph":

Moore Graph - Examples
... The Moore graphs are The complete graphs on n > 2 nodes ... (diameter n, girth 2n+1, degree 2, order 2n+1) The Petersen graph. 5, degree 3, order 10) The Hoffman–Singleton graph ...

Famous quotes containing the words graph and/or moore:

    In this Journal, my pen is a delicate needle point, tracing out a graph of temperament so as to show its daily fluctuations: grave and gay, up and down, lamentation and revelry, self-love and self-disgust. You get here all my thoughts and opinions, always irresponsible and often contradictory or mutually exclusive, all my moods and vapours, all the varying reactions to environment of this jelly which is I.
    W.N.P. Barbellion (1889–1919)

    Down the chimney St. Nicholas came with a bound.
    He was dressed all in fur, from his head to his foot,
    And his clothes were all tarnished with ashes and soot;
    —Clement Clarke Moore (1779–1863)