LEADER 03895nam  2200553   450 
001 996466410303316
005 20220610112106.0
010   $a3-030-58892-0
024 7 $a10.1007/978-3-030-58892-2
035   $a(CKB)4100000011918890
035   $a(DE-He213)978-3-030-58892-2
035   $a(MiAaPQ)EBC6606007
035   $a(Au-PeEL)EBL6606007
035   $a(OCoLC)1250085625
035   $a(PPN)255881584
035   $a(EXLCZ)994100000011918890
100   $a20220115d2021      uy             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 00$aStructures of domination in graphs /$fTeresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, editors
205   $a1st ed. 2021.
210  1$aCham, Switzerland :$cSpringer,$d[2021]
210  4$d©2021
215   $a1 online resource (VIII, 536 p. 169 illus., 61 illus. in color.)
225 1 $aDevelopments in mathematics ;$vVolume 66
311   $a3-030-58891-2 
320   $aIncludes bibliographical references.
327   $a1. 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).
330   $aThis 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.
410  0$aDevelopments in mathematics ;$vVolume 66.
606   $aDomination (Graph theory)
606   $aTeoria de grafs$2thub
608   $aLlibres electrònics$2thub
615  0$aDomination (Graph theory)
615  7$aTeoria de grafs
676   $a511.5
702   $aHaynes$b Teresa W.$f1953-
702   $aHedetniemi$b S. T.
702   $aHenning$b Michael A.
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996466410303316
996   $aStructures of Domination in Graphs$91999274
997   $aUNISA