Sierpiński Carpet Graph -- from Wolfram MathWorld

Download Wolfram Notebook

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

The -Sierpiński carpet graph has vertices and 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. https://mathworld.wolfram.com/SierpinskiCarpetGraph.html

Subject classifications

• Discrete Mathematics
• Graph Theory
• Simple Graphs
• Sierpinski Carpet Graphs

• Discrete Mathematics
• Graph Theory
• Simple Graphs
• Uniquely Colorable Graphs