TOPICS
Search

Hexagonal Grid Graph


HexagonalGridGraph

A k×m×n hexagonal grid graph is a graph of adjoined hexagons consisting of k hexagons along the horizontal triangular axis, m along the northeast axis, and n along the northwest. Some small hexagonal grid graphs are illustrated above.

Hexagonal grid graphs are unit-distance graphs by construction.

k×m×1 hexagonal grid graphs may be implemented in a future version of the Wolfram Language as HexagonalGridGraph.


See also

Hexagon, Hexagonal Grid

Explore with Wolfram|Alpha

References

azerbajdzan. "Creating hexagonal grid (hexagonal grid graph)." Oct. 8, 2020. https://mathematica.stackexchange.com/questions/231479/creating-hexagonal-grid-hexagonal-grid-graph.

Cite this as:

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

Subject classifications