Abstract
In this study, the cops and robber game is transferred to the Sierpinski graph, Sierpinski-like graphs [Formula: see text] and [Formula: see text], Sierpinski gasket graph [Formula: see text], and generalized Sierpinski graphs [Formula: see text] where [Formula: see text] has an order four and [Formula: see text]. We show that the cop number of these graphs is [Formula: see text], excluding [Formula: see text]. We also give a strategy for the cops to win.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
