TOPICS
Search

Doob Graph


DoobGraphs

The Doob graph D(m,n) is the graph given by the graph Cartesian product of m>=1 copies of the Shrikhande graph with a Hamming graph H(n,4). Doob graphs are distance-regular and integral with the same parameters as H(n+2m,4) (Brouwer et al. 1989, p. 262).


See also

Egawa Graph, Hamming Graph, Shrikhande Graph

Explore with Wolfram|Alpha

References

Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance-Regular Graphs. New York: Springer-Verlag, pp. 27 and 262, 1989.Godsil, C. D. "Eigenpolytopes of Distance Regular Graphs." Canad. J. Math. 59, 739-755, 1998.

Referenced on Wolfram|Alpha

Doob Graph

Cite this as:

Weisstein, Eric W. "Doob Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/DoobGraph.html

Subject classifications