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.