|
|
|
|
| LEADER |
03263nmm a2200301 u 4500 |
| 001 |
EB001993312 |
| 003 |
EBX01000000000000001156214 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
210608 ||| eng |
| 020 |
|
|
|a 9783030588922
|
| 100 |
1 |
|
|a Haynes, Teresa W.
|e [editor]
|
| 245 |
0 |
0 |
|a Structures of Domination in Graphs
|h Elektronische Ressource
|c edited by Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning
|
| 250 |
|
|
|a 1st ed. 2021
|
| 260 |
|
|
|a Cham
|b Springer International Publishing
|c 2021, 2021
|
| 300 |
|
|
|a VIII, 536 p. 169 illus., 61 illus. in color
|b online resource
|
| 505 |
0 |
|
|a 1. Glossary of Common Terms (Haynes) -- Part 1. Related Parameters: 2. Broadcast Domination in Graphs (MacGillivray) -- 3. Alliances and Related Domination Parameters (Haynes) -- 4. Fractional Domatic, Idomatic and Total Domatic Numbers of a Graph (Goddard) -- 5. Dominator and Total Dominator Colorings in Graphs (Henning) -- 6. Irredundance (Mynhardt) -- 7. The Private Neighbor Concept (McRae) -- 8. An Introduction to Game Domination in Graphs (Henning) -- 9. Domination and Spectral Graph Theory (Hoppen) -- 10. Varieties of Roman Domination (Chellali) -- Part 2. Domination in Selected Graph Families: 11. Domination and Total Domination in Hypergraphs (Yeo) -- 12. Domination in Chessboards (Hedetniemi) -- 13. Domination in Digraphs (Haynes) -- Part 3. Algorithms and Complexity: 14. Algorithms and Complexity of Signed, Minus and Majority Domination (McRae) -- 15. Algorithms and Complexity of Power Domination in Graphs (Mohan) -- 16. Self-Stabilizing Domination Algorithms (Hedetniemi) -- 17. Algorithms and Complexity of Alliances in Graphs (Hedetniemi)
|
| 653 |
|
|
|a Graph Theory
|
| 653 |
|
|
|a Graph theory
|
| 700 |
1 |
|
|a Hedetniemi, Stephen T.
|e [editor]
|
| 700 |
1 |
|
|a Henning, Michael A.
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Developments in Mathematics
|
| 028 |
5 |
0 |
|a 10.1007/978-3-030-58892-2
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-030-58892-2?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 511.5
|
| 520 |
|
|
|a This volume comprises 17 contributions that present advanced topics in graph domination, featuring open problems, modern techniques, and recent results. The book is divided into 3 parts. The first part focuses on several domination-related concepts: broadcast domination, alliances, domatic numbers, dominator colorings, irredundance in graphs, private neighbor concepts, game domination, varieties of Roman domination and spectral graph theory. The second part covers domination in hypergraphs, chessboards, and digraphs and tournaments. The third part focuses on the development of algorithms and complexity of signed, minus and majority domination, power domination, and alliances in graphs. The third part also includes a chapter on self-stabilizing algorithms. Of extra benefit to the reader, the first chapter includes a glossary of commonly used terms. The book is intended to provide a reference for established researchers in the fields of domination and graph theory and graduate students who wish to gain knowledge of the topics covered as well as an overview of the major accomplishments and proof techniques used in the field
|