Sierpiński Carpet Graph


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

Cite this as:

Weisstein, Eric W. "Sierpiński Carpet Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications