On the cop number of Sierpinski-like graphs

被引：0

作者：

Cakmak, Nazlican ^{[1
,2
]}

Akyar, Emrah ^{[1
]}

机构：

[1] Eskisehir Tech Univ, Dept Math, TR-26470 Eskisehir, Turkiye

[2] Baskent Univ, Vocat Sch Tech Sci, TR-06790 Ankara, Turkiye

来源：

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS | 2024年 / 16卷 / 04期

关键词：

Cops and Robber; cop number; Sierpinski graphs; VERTEX;

D O I：

10.1142/S1793830923500349

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页数：11

共 12 条

[1] A GAME OF COPS AND ROBBERS [J].

AIGNER, M ;

FROMME, M .

DISCRETE APPLIED MATHEMATICS, 1984, 8 (01) :1-12

[2]

Bonato A., 2011, Student Mathematical Library, V61

[3] Cops and robbers on directed and undirected abelian Cayley graphs [J].

Bradshaw, Peter ;

Hosseini, Seyyed Aliasghar ;

Turcotte, Jeremie .

EUROPEAN JOURNAL OF COMBINATORICS, 2021, 97

[4] Cops and Robber on some families of oriented graphs [J].

Das, Sandip ;

Gahlawat, Harmender ;

Sahoo, Uma Kant ;

Sen, Sagnik .

THEORETICAL COMPUTER SCIENCE, 2021, 888 :31-40

[5] A survey and classification of Sierpinski-type graphs [J].

Hinz, Andreas M. ;

Klavzar, Sandi ;

Zemljic, Sara Sabrina .

DISCRETE APPLIED MATHEMATICS, 2017, 217 :565-600

[6]

Hinz Andreas M., 2013, The Tower of Hanoi-Myths and Maths

[7] Vertex-, edge-, and total-colorings of Sierpinski-like graphs [J].

Jakovac, Marko ;

Klavzar, Sandi .

DISCRETE MATHEMATICS, 2009, 309 (06) :1548-1556

[8] Catching an infinitely fast robber on a grid [J].

Kinnersley, William B. ;

Townsend, Nikolas .

DISCRETE APPLIED MATHEMATICS, 2022, 320 :446-461

[9] Crossing numbers of Sierpinski-like graphs [J].

Klavzar, S ;

Mohar, B .

JOURNAL OF GRAPH THEORY, 2005, 50 (03) :186-198

[10] Graphs S(n,k) and a variant of the tower of Hanoi problem [J].

Klavzar, S ;

Milutinovic, U .

CZECHOSLOVAK MATHEMATICAL JOURNAL, 1997, 47 (01) :95-104

← 1 2 →