[Go to site: main page, start]
TOPICS
Search

Hexacode Graph

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook
HexacodeGraph

The hexacode graph is the incidence graph of the unique symmetric transversal design STD_2[6;3]. It is also a bipartite (0,2)-graph. It is illustrated above in all 45 of its order-3 LCF embeddings, a voltage graph embedding, and a bipartite embedding.

The hexacode graph is a distance-transitive graph on 36 vertices having intersection array {6,5,4,1;1,2,5,6}.

It is an integral graph with graph spectrum (-6)^1(-sqrt(6))^(12)0^(10)(sqrt(6))^126^1.

The hexacode graph is implemented in the Wolfram Language as GraphData["HexacodeGraph"].

See also

Distance-Regular Graph

Explore with Wolfram|Alpha

References

DistanceRegular.org. "Hexacode Graph." https://www.math.mun.ca/distanceregular/graphs/hexacodegraph.html.House of Graphs. "Hexacode Graph." https://houseofgraphs.org/graphs/51401.

Referenced on Wolfram|Alpha

Hexacode Graph

Cite this as:

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

Subject classifications