Function Repository Resource:

TriangularGridGraph

Source Notebook

Create a triangular grid graph

Contributed by: Eric Weisstein (with contributions by Jibiana Jakpor)

ResourceFunction["TriangularGridGraph"][n]

creates a triangular grid graph from a triangular lattice of order n+1.

Details

ResourceFunction["TriangularGridGraph"] takes the same options as Graph.

Examples

Basic Examples (2) 

A triangular grid graph:

In[1]:=
ResourceFunction["TriangularGridGraph"][10]
Out[1]=

Order 2 has 2 triangles and 3 vertices on each side:

In[2]:=
ResourceFunction["TriangularGridGraph"][2]
Out[2]=

Properties and Relations (2) 

Compare grid graphs corresponding to different Euclidean tilings:

In[3]:=
{ResourceFunction["TriangularGridGraph"][8], GridGraph[{9, 9}], ResourceFunction["HexagonalGridGraph"][{8, 8}]}
Out[3]=

Compare a triangular grid graph and a graph obtained from the Sierpinski triangle:

In[4]:=
{ResourceFunction["TriangularGridGraph"][16], MeshConnectivityGraph[SierpinskiMesh[4], 0]}
Out[4]=

Publisher

Wolfram Summer Camp

Version History

  • 1.0.0 – 01 August 2022

Related Resources

License Information