 TOPICS # Triangular Grid Graph The triangular grid graph is the lattice graph obtained by interpreting the order- triangular grid as a graph, with the intersection of grid lines being the vertices and the line segments between vertices being the edges. Equivalently, it is the graph on vertices with being nonnegative integers summing to such that vertices are adjacent if the sum of absolute differences of the coordinates of two vertices is 2 (West 2000, p. 391).

The graph bandwidth of is (West 2000, p. 392). is also the hexagonal king graph of order , i.e., the connectivity graph of possible moves of a king chess piece on a hexagonal chessboard.

Hanoi Graph, Lattice Graph, Sierpiński Gasket Graph, Triangular Grid

## Explore with Wolfram|Alpha More things to try:

## References

West, D. B. Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, pp. 390-392, 2000.

## Cite this as:

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