TOPICS
Search

Sierpiński Carpet Graph

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook
SierpinskiCarpetGraph

The nth-order Sierpiński carpet graph is the connectivity graph of black squares in the nth iteration of the Sierpiński carpet fractal. The first three iterations are shown above, with n=1 corresponding to the cycle graph C_8.

The n-Sierpiński carpet graph has 8^n vertices and 8(8^n-3^n) edges.

See also

Sierpiński Carpet, Sierpiński Gasket Graph

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

References

House of Graphs. Sierpiński Carpet Graphs. C8 and Sierpinski Carpet Graph SC2.

Referenced on Wolfram|Alpha

Sierpiński Carpet Graph

Cite this as:

Weisstein, Eric W. "Sierpiński Carpet Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SierpinskiCarpetGraph.html

Subject classifications