Softcover ISBN: | 978-1-4704-6763-0 |
Product Code: | STML/97 |
List Price: | $59.00 |
Individual Price: | $47.20 |
eBook ISBN: | 978-1-4704-7100-2 |
Product Code: | STML/97.E |
List Price: | $59.00 |
Individual Price: | $47.20 |
Softcover ISBN: | 978-1-4704-6763-0 |
eBook: ISBN: | 978-1-4704-7100-2 |
Product Code: | STML/97.B |
List Price: | $118.00 $88.50 |
Softcover ISBN: | 978-1-4704-6763-0 |
Product Code: | STML/97 |
List Price: | $59.00 |
Individual Price: | $47.20 |
eBook ISBN: | 978-1-4704-7100-2 |
Product Code: | STML/97.E |
List Price: | $59.00 |
Individual Price: | $47.20 |
Softcover ISBN: | 978-1-4704-6763-0 |
eBook ISBN: | 978-1-4704-7100-2 |
Product Code: | STML/97.B |
List Price: | $118.00 $88.50 |
-
Book DetailsStudent Mathematical LibraryVolume: 97; 2022; 254 ppMSC: Primary 05; 68
Graphs measure interactions between objects such as friendship links on Twitter, transactions between Bitcoin users, and the flow of energy in a food chain. While graphs statically represent interacting systems, they may also be used to model dynamic interactions. For example, imagine an invisible evader loose on a graph, leaving only behind breadcrumb clues to their whereabouts. You set out with pursuers of your own, seeking out the evader's location. Would you be able to detect their location? If so, then how many resources are needed for detection, and how fast can that happen? These basic-seeming questions point towards the broad conceptual framework of pursuit-evasion games played on graphs. Central to pursuit-evasion games on graphs is the idea of optimizing certain parameters, whether they are the cop number, burning number, or localization number, for example.
This book would be excellent for a second course in graph theory at the undergraduate or graduate level. It surveys different areas in graph searching and highlights many fascinating topics intersecting classical graph theory, geometry, and combinatorial designs. Each chapter ends with approximately twenty exercises and five larger scale projects.
ReadershipUndergraduate and graduate students and researchers interested in graph searching and pursuit-evasion games.
-
Table of Contents
-
Chapters
-
Introduction
-
Cops and robbers
-
Graph searching
-
Graph burning
-
The localization game
-
Firefighter
-
Invisible robber games
-
Variants of pursuit-evasion games
-
-
Additional Material
-
Reviews
-
As a whole, it's remarkable how Dr. Bonato has distilled a huge body of literature into an extensively referenced 250 page book that could have easily been at least twice that length. Researchers will surely find this a helpful reference text, with lots of important results and proofs conveniently organized in one place, but they are also likely to encounter something new and interesting, and probably an open problem or two to ponder. Meanwhile, those who are newer to exploring these topics will almost certainly find at least one motivating idea --- a particular application or an entry point into the theory --- that gets them hooked into reading more.
Brendan W. Sullivan (Carnegie Mellon University), The American Mathematical Monthly -
The text is primarily intended to support a one-semester course for graduate students or outstanding undergraduates who have already taken a class on graph theory. It could also be a useful entrance point for mathematicians who want an overview of pursuit-evasion games. The author provides many exercises, as well as several suggestions for more ambitious research projects. Overall, the book is reader friendly and engaging, with many helpful figures and illustrations. The author writes in the preface that the book aims to be 'self-contained, understandable, and accessible to a broad mathematical audience,' and it achieves that goal.
Thomas Wiseman, University of Texas at Austin
-
-
RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Additional Material
- Reviews
- Requests
Graphs measure interactions between objects such as friendship links on Twitter, transactions between Bitcoin users, and the flow of energy in a food chain. While graphs statically represent interacting systems, they may also be used to model dynamic interactions. For example, imagine an invisible evader loose on a graph, leaving only behind breadcrumb clues to their whereabouts. You set out with pursuers of your own, seeking out the evader's location. Would you be able to detect their location? If so, then how many resources are needed for detection, and how fast can that happen? These basic-seeming questions point towards the broad conceptual framework of pursuit-evasion games played on graphs. Central to pursuit-evasion games on graphs is the idea of optimizing certain parameters, whether they are the cop number, burning number, or localization number, for example.
This book would be excellent for a second course in graph theory at the undergraduate or graduate level. It surveys different areas in graph searching and highlights many fascinating topics intersecting classical graph theory, geometry, and combinatorial designs. Each chapter ends with approximately twenty exercises and five larger scale projects.
Undergraduate and graduate students and researchers interested in graph searching and pursuit-evasion games.
-
Chapters
-
Introduction
-
Cops and robbers
-
Graph searching
-
Graph burning
-
The localization game
-
Firefighter
-
Invisible robber games
-
Variants of pursuit-evasion games
-
As a whole, it's remarkable how Dr. Bonato has distilled a huge body of literature into an extensively referenced 250 page book that could have easily been at least twice that length. Researchers will surely find this a helpful reference text, with lots of important results and proofs conveniently organized in one place, but they are also likely to encounter something new and interesting, and probably an open problem or two to ponder. Meanwhile, those who are newer to exploring these topics will almost certainly find at least one motivating idea --- a particular application or an entry point into the theory --- that gets them hooked into reading more.
Brendan W. Sullivan (Carnegie Mellon University), The American Mathematical Monthly -
The text is primarily intended to support a one-semester course for graduate students or outstanding undergraduates who have already taken a class on graph theory. It could also be a useful entrance point for mathematicians who want an overview of pursuit-evasion games. The author provides many exercises, as well as several suggestions for more ambitious research projects. Overall, the book is reader friendly and engaging, with many helpful figures and illustrations. The author writes in the preface that the book aims to be 'self-contained, understandable, and accessible to a broad mathematical audience,' and it achieves that goal.
Thomas Wiseman, University of Texas at Austin