
The Game of Cops and Robbers on Graphs
American Mathematical Society (Publisher)
Published on 30. September 2011
Book
Paperback/Softback
276 pages
978-0-8218-5347-4 (ISBN)
Description
This book is the first and only one of its kind on the topic of Cops and Robbers games, and more generally, on the field of vertex pursuit games on graphs. The book is written in a lively and highly readable fashion, which should appeal to both senior undergraduates and experts in the field (and everyone in between). One of the main goals of the book is to bring together the key results in the field; as such, it presents structural, probabilistic, and algorithmic results on Cops and Robbers games. Several recent and new results are discussed, along with a comprehensive set of references. The book is suitable for self-study or as a textbook, owing in part to the over 200 exercises. The reader will gain insight into all the main directions of research in the field and will be exposed to a number of open problems.
Reviews / Votes
The authors do a wonderful job of keeping the exposition lively and engaging, while still covering some deep mathematics and introducing some fascinating ideas. The technical background required to read this book is relatively low, and the authors do a good job of introducing the relevant background as needed. For these reasons, as well as the fact that the subject is itself engaging, this is a book that I would happily hand to an undergraduate math major for an independent study, capstone project, or even just to read for fun! But it is also a book that I think any mathematician could pick up and quickly learn something new and interesting. And I cannot think of a higher compliment to give than that." - Darren Glass, MAA Online"This is a textbook that presents the state of the art in the literature on Cops and Robbers games and, more generally, vertex pursuit games on graphs." - Giacomo Bonanno, Zentralblatt MATH
"[This] book is well written, informative, and fun to read. It easily meets the goals of surveying the main directions in the area, and of providing a tool through which one could learn about games and graphs. Thus, it is useful both as an introduction and a reference." - Gary MacGillivray, MathSciNet
More details
Series
Language
English
Place of publication
Providence
United States
Target group
Professional and scholarly
Dimensions
Height: 213 mm
Width: 137 mm
Thickness: 17 mm
Weight
357 gr
ISBN-13
978-0-8218-5347-4 (9780821853474)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Persons
Anthony Bonato, Ryerson University, Toronto, ON, Canada
Richard J. Nowakowski, Dalhousie University, Halifax, NS, Canada
Richard J. Nowakowski, Dalhousie University, Halifax, NS, Canada
Content
Preface
Introduction
Characterizations
Meyniel's conjecture
Graph products and classes
Algorithms
Random graphs
Infinite graphs
Variants of Cops and Robbers
Good guys versus bad guys
Bibliography
Index
Introduction
Characterizations
Meyniel's conjecture
Graph products and classes
Algorithms
Random graphs
Infinite graphs
Variants of Cops and Robbers
Good guys versus bad guys
Bibliography
Index