In graph theory, the degree diameter problem is the problem of finding the largest possible graph G (in terms of the size of its vertex set V) of diameter k such that the largest degree of any of the vertices in G is at most d. The size of G is bounded above by the Moore bound; for 1 < k and 2 < d only the Petersen graph, the Hoffman-Singleton graph, and maybe a graph of diameter k = 2 and degree d = 57 attain the Moore bound. In general the largest degree-diameter graphs are much smaller in size than the Moore bound.
Read more about Degree Diameter Problem: See Also
Famous quotes containing the words degree and/or problem:
“Every man beholds his human condition with a degree of melancholy. As a ship aground is battered by the waves, so man, imprisoned in mortal life, lies open to the mercy of coming events.”
—Ralph Waldo Emerson (1803–1882)
“I used to be a discipline problem, which caused me embarrassment until I realized that being a discipline problem in a racist society is sometimes an honor.”
—Ishmael Reed (b. 1938)