Domination in Graphs: Core Concepts

Teresa W Haynes author Stephen T Hedetniemi author Michael A Henning author

Format:Hardback

Publisher:Springer International Publishing AG

Published:30th Apr '23

Currently unavailable, and unfortunately no date known when it will be back

Domination in Graphs: Core Concepts cover

This monograph is designed to be an in-depth introduction to domination in graphs. It focuses on three core concepts: domination, total domination, and independent domination. It contains major results on these foundational domination numbers, including a wide variety of in-depth proofs of selected results providing the reader with a toolbox of proof techniques used in domination theory. Additionally, the book is intended as an invaluable reference resource for a variety of readerships, namely, established researchers in the field of domination who want an updated, comprehensive coverage of domination theory; next, researchers in graph theory who wish to become acquainted with newer topics in domination, along with major developments in the field and some of the proof techniques used; and, graduate students with interests in graph theory, who might find the theory and many real-world applications of domination of interest for masters and doctoral thesis topics. The focusedcoverage also provides a good basis for seminars in domination theory or domination algorithms and complexity.

The authors set out to provide the community with an updated and comprehensive treatment on the major topics in domination in graphs. And by Jove, they’ve done it! In recent years, the authors have curated and published two contributed volumes: Topics in Domination in Graphs, © 2020 and Structures of Domination in Graphs, © 2021. This book rounds out the coverage entirely. The reader is assumed to be acquainted with the basic concepts of graph theory and has had some exposure to graph theory at an introductory level. As graph theory terminology sometimes varies, a glossary of terms and notation is provided at the end of the book.


“One remarkable aspect of this book is its readability. Despite the complex subject matter, the authors have succeeded in making the material accessible to a wide range of readers. … The book’s structure is well-organized … . It covers a wide range of topics, from historical origins and fundamental concepts to complexity and algorithms, upper bounds, probabilistic bounds, and much more. Each chapter offers a comprehensive exploration of its respective subject matter, complete with proofs and examples … .” (Aleksandra Tepeh, zbMATH 1526.05002, 2024)

ISBN: 9783031094958

Dimensions: unknown

Weight: unknown

644 pages