The 
th-order
Sierpiński carpet graph, where 
is a positive integer,
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 
.
-Sierpiński
carpet graph has 
