Cops and Robber on Butterflies and Solid Grids

Sheikh Shakil Akhtar; Sandip Das; Harmender Gahlawat

doi:10.1007/978-3-030-67899-9_21

Cops and Robber on Butterflies and Solid Grids

Sheikh Shakil Akhtar, Sandip Das, Harmender Gahlawat

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Cops and robber is a well-studied two player pursuit-evasion game played on a graph. In this game, a set of cops, controlled by the first player, tries to capture the position of a robber, controlled by the second player. The cop number of a graph is the minimum number of cops required to capture the robber in the graph. We show that the cop number for butterfly networks and for solid grids is two.

Original language	English
Title of host publication	Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Proceedings
Editors	Apurva Mudgal, C. R. Subramanian
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	272-281
Number of pages	10
ISBN (Print)	9783030678982
DOIs	https://doi.org/10.1007/978-3-030-67899-9_21
State	Published - 1 Jan 2021
Externally published	Yes
Event	7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021 - Rupnagar, India Duration: 11 Feb 2021 → 13 Feb 2021

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12601 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021
Country/Territory	India
City	Rupnagar
Period	11/02/21 → 13/02/21

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-030-67899-9_21

Cite this

Akhtar, S. S., Das, S., & Gahlawat, H. (2021). Cops and Robber on Butterflies and Solid Grids. In A. Mudgal, & C. R. Subramanian (Eds.), Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Proceedings (pp. 272-281). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12601 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-67899-9_21

Akhtar, Sheikh Shakil ; Das, Sandip ; Gahlawat, Harmender. / Cops and Robber on Butterflies and Solid Grids. Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Proceedings. editor / Apurva Mudgal ; C. R. Subramanian. Springer Science and Business Media Deutschland GmbH, 2021. pp. 272-281 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{af7faca4e36b43d099500a4d1a98c223,

title = "Cops and Robber on Butterflies and Solid Grids",

abstract = "Cops and robber is a well-studied two player pursuit-evasion game played on a graph. In this game, a set of cops, controlled by the first player, tries to capture the position of a robber, controlled by the second player. The cop number of a graph is the minimum number of cops required to capture the robber in the graph. We show that the cop number for butterfly networks and for solid grids is two.",

author = "Akhtar, {Sheikh Shakil} and Sandip Das and Harmender Gahlawat",

note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021 ; Conference date: 11-02-2021 Through 13-02-2021",

year = "2021",

month = jan,

day = "1",

doi = "10.1007/978-3-030-67899-9_21",

language = "English",

isbn = "9783030678982",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "272--281",

editor = "Apurva Mudgal and Subramanian, {C. R.}",

booktitle = "Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Proceedings",

address = "Germany",

}

Akhtar, SS, Das, S & Gahlawat, H 2021, Cops and Robber on Butterflies and Solid Grids. in A Mudgal & CR Subramanian (eds), Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12601 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 272-281, 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021, Rupnagar, India, 11/02/21. https://doi.org/10.1007/978-3-030-67899-9_21

Cops and Robber on Butterflies and Solid Grids. / Akhtar, Sheikh Shakil; Das, Sandip; Gahlawat, Harmender.
Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Proceedings. ed. / Apurva Mudgal; C. R. Subramanian. Springer Science and Business Media Deutschland GmbH, 2021. p. 272-281 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12601 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Cops and Robber on Butterflies and Solid Grids

AU - Akhtar, Sheikh Shakil

AU - Das, Sandip

AU - Gahlawat, Harmender

PY - 2021/1/1

Y1 - 2021/1/1

N2 - Cops and robber is a well-studied two player pursuit-evasion game played on a graph. In this game, a set of cops, controlled by the first player, tries to capture the position of a robber, controlled by the second player. The cop number of a graph is the minimum number of cops required to capture the robber in the graph. We show that the cop number for butterfly networks and for solid grids is two.

AB - Cops and robber is a well-studied two player pursuit-evasion game played on a graph. In this game, a set of cops, controlled by the first player, tries to capture the position of a robber, controlled by the second player. The cop number of a graph is the minimum number of cops required to capture the robber in the graph. We show that the cop number for butterfly networks and for solid grids is two.

UR - http://www.scopus.com/inward/record.url?scp=85101357211&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-67899-9_21

DO - 10.1007/978-3-030-67899-9_21

M3 - Conference contribution

AN - SCOPUS:85101357211

SN - 9783030678982

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 272

EP - 281

BT - Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Proceedings

A2 - Mudgal, Apurva

A2 - Subramanian, C. R.

PB - Springer Science and Business Media Deutschland GmbH

T2 - 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021

Y2 - 11 February 2021 through 13 February 2021

ER -

Akhtar SS, Das S, Gahlawat H. Cops and Robber on Butterflies and Solid Grids. In Mudgal A, Subramanian CR, editors, Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Proceedings. Springer Science and Business Media Deutschland GmbH. 2021. p. 272-281. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-67899-9_21

Cops and Robber on Butterflies and Solid Grids

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this