Shulph Ink
Structures of Domination in Graphs
Structures of Domination in Graphs
- Condition: Brand new
- UK Delivery times: Usually arrives within 2 - 3 working days
- UK Shipping: Fee starts at £2.39. Subject to product weight & dimension
Couldn't load pickup availability
Excellent- More about Structures of Domination in Graphs
This volume presents advanced topics in graph domination, including broadcast domination, alliances, domatic numbers, dominator colorings, irredundance, private neighbor concepts, game domination, spectral graph theory, hypergraphs, chessboards, digraphs, tournaments, and self-stabilizing algorithms. It is intended for established researchers and graduate students.
Format: Hardback
Length: 536 pages
Publication date: 05 May 2021
Publisher: Springer Nature Switzerland AG
This comprehensive volume presents a diverse range of 17 contributions that delve into advanced topics related to graph domination. Spanning from open problems to modern techniques and recent results, it offers a comprehensive exploration of this captivating field. The book is organized into three distinct parts, each dedicated to exploring different aspects of graph domination.
The first part focuses on various domination-related concepts, including broadcast domination, alliances, domatic numbers, dominator colorings, irredundance in graphs, private neighbor concepts, game domination, varieties of Roman domination, and spectral graph theory. Each concept is explored in depth, providing a solid foundation for understanding the broader aspects of graph domination.
The second part delves into domination in hypergraphs, chessboards, and digraphs, as well as tournaments. It explores the interplay of dominance principles in these different graph structures and discusses the application of domination in various competitive settings. The chapter on self-stabilizing algorithms is particularly valuable, offering insights into designing efficient algorithms for graph domination problems.
The third part of the book is dedicated to the development of algorithms and complexity analysis of signed, minus, majority, power, and alliances in graphs. It discusses the theoretical foundations and practical applications of these domination-related concepts, highlighting the key techniques and proof methods employed in the field. Additionally, the first chapter includes a comprehensive glossary of commonly used terms, aiding the reader in navigating the complex terminology of graph domination.
This book serves as a valuable resource for established researchers in the fields of domination and graph theory, as well as graduate students seeking to gain a deeper understanding of these topics. It provides an overview of the major accomplishments and proof techniques used in the field, while also presenting cutting-edge research and developments. With its comprehensive coverage and accessible writing style, the book is an essential tool for anyone interested in exploring the world of graph domination.
Weight: 1024g
Dimension: 163 x 241 x 38 (mm)
ISBN-13: 9783030588915
Edition number: 1st ed. 2021
This item can be found in:
UK and International shipping information
UK and International shipping information
UK Delivery and returns information:
- Delivery within 2 - 3 days when ordering in the UK.
- Shipping fee for UK customers from £2.39. Fully tracked shipping service available.
- Returns policy: Return within 30 days of receipt for full refund.
International deliveries:
Shulph Ink now ships to Australia, Canada, France, Ireland, Italy, Germany, Spain, Netherlands, New Zealand and the United States of America.
- Delivery times: within 5 - 20 business days when ordering to France, Germany, Ireland, Spain, Canada and the United States. Up to 30 business days for Australia and New Zealand.
- Shipping fee: charges vary for overseas orders. Only tracked services are available for international orders.
- Customs charges: If ordering to addresses outside the United Kingdom, you may or may not incur additional customs and duties fees during local delivery.
