Tetrahedral Johnson Graph

A Johnson graph of the from J(n,3) (with n>=6) is known as an n-tetrahedral graph. To avoid confusion with the tetrahedral graph K_4, such graphs are known in this work as tetrahedral Jonson graphs. The tetrahedral Johnson graphs are distance-regular and geometric.

The 6-tetrahedral Johnson graph is a distance-regular graph with intersection array {9,4,1;1,4,9}, and therefore also a Taylor graph.

See also

Johnson Graph, Tetrahedral Graph

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Tetrahedral Johnson Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications