On The Cop Number of Sierpinski-Like Graphs

Abstract

In this study, the cops and robber game is transferred to the Sierpinski graph, Sierpinski-like graphs S+(n,k) and S++(n,k), Sierpinski gasket graph Sn, and generalized Sierpinski graphs S(n,G) where G has an order four and S(n,C-k). We show that the cop number of these graphs is 2, excluding S++. We also give a strategy for the cops to win.