03895nam 2200553 450 99646641030331620220610112106.03-030-58892-010.1007/978-3-030-58892-2(CKB)4100000011918890(DE-He213)978-3-030-58892-2(MiAaPQ)EBC6606007(Au-PeEL)EBL6606007(OCoLC)1250085625(PPN)255881584(EXLCZ)99410000001191889020220115d2021 uy 0engurnn#008mamaatxtrdacontentcrdamediacrrdacarrierStructures of domination in graphs /Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, editors1st ed. 2021.Cham, Switzerland :Springer,[2021]©20211 online resource (VIII, 536 p. 169 illus., 61 illus. in color.)Developments in mathematics ;Volume 663-030-58891-2 Includes bibliographical references.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).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.Developments in mathematics ;Volume 66.Domination (Graph theory)Teoria de grafsthubLlibres electrònicsthubDomination (Graph theory)Teoria de grafs511.5Haynes Teresa W.1953-Hedetniemi S. T.Henning Michael A.MiAaPQMiAaPQMiAaPQBOOK996466410303316Structures of Domination in Graphs1999274UNISA01003nam a22002297 4500991003162119707536080108s1838 be 000 0 lat b13641499-39ule_instDip.to Studi GiuridiciitaMuhlenbruch, Christian Friedrich,1785-1843627170Doctrina Pandectarum :Scholarum in usum /scripsit C.F. MuhlenbruchEditio nova, auctior et emendatior, in qua omnia continentur, quae in recentissima editione Germanica adjecta vel immutata sunt ...Bruxellis,Apud Hauman,1838xvi, 724 p. ;24 cm.Diritto romanoDiritto civileGermania.b1364149928-01-1408-01-08991003162119707536LE027 F/A II B MUH01.0112027000141302le027Fondo DoriapE0.00-no 00000.i1464229308-01-08Doctrina Pandectarum1212624UNISALENTOle02708-01-08ma -latbe 00