Degree diameter problem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Template:Short description <templatestyles src="Unsolved/styles.css" />

Unsolved problem in mathematics
Given two positive integers Template:Mvar, Template:Mvar, what is the largest graph of diameter Template:Mvar such that all vertices have degrees at most Template:Mvar?

Script error: No such module "Unsubst".

File:Degree-Diameter trivials.png
When the degree is less than or equal to 2 or the diameter is less than or equal to 1, the problem becomes trivial, solved by the cycle graph and complete graph respectively.

In graph theory, the degree diameter problem is the problem of finding the largest possible graph Template:Mvar (in terms of the size of its vertex set Template:Mvar) of diameter Template:Mvar such that the largest degree of any of the vertices in Template:Mvar is at most Template:Mvar. The size of Template:Mvar is bounded above by the Moore bound; for 1 < kScript error: No such module "Check for unknown parameters". and 2 < dScript error: No such module "Check for unknown parameters"., only the Petersen graph, the Hoffman-Singleton graph, and possibly graphs (not yet proven to exist) of diameter k = 2Script error: No such module "Check for unknown parameters". and degree d = 57Script error: No such module "Check for unknown parameters". attain the Moore bound. In general, the largest degree-diameter graphs are much smaller in size than the Moore bound.

Formula

Let nd,k be the maximum possible number of vertices for a graph with degree at most d and diameter k. Then nd,kMd,k, where Md,k is the Moore bound:

Md,k={1+d(d1)k1d2 if d>22k+1 if d=2

This bound is attained for very few graphs, thus the study moves to how close there exist graphs to the Moore bound. For asymptotic behaviour note that Md,k=dk+O(dk1).

Define the parameter μk=lim infdnd,kdk. It is conjectured that μk=1 for all k. It is known that μ1=μ2=μ3=μ5=1 and that μ41/4.

See also

References

<templatestyles src="Refbegin/styles.css" />

  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".


Template:Hyperbolic-geometry-stub Template:Graph-stub