國立虎尾科技大學 |

Structures of Domination in Graphs

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Structures of Domination in Graphs / edited by Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning.
其他作者:	Henning, Michael A.
面頁冊數:	VIII, 536 p. 169 illus., 61 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Graph Theory. -
電子資源:	https://doi.org/10.1007/978-3-030-58892-2
ISBN:	9783030588922

Structures of Domination in Graphs
Structures of Domination in Graphs [electronic resource] /edited by Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning. - 1st ed. 2021. - VIII, 536 p. 169 illus., 61 illus. in color.online resource. - Developments in Mathematics,662197-795X ;. - Developments in Mathematics,41.

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.

ISBN: 9783030588922

Standard No.: 10.1007/978-3-030-58892-2doiSubjects--Topical Terms:

786670
Graph Theory.

LC Class. No.: QA166-166.247

Dewey Class. No.: 511.5

Structures of Domination in Graphs
LDR:03668nam a22004095i 4500 001 1053668
003 DE-He213
005 20210815040649.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030588922 $9 978-3-030-58892-2
024 7 $a 10.1007/978-3-030-58892-2 $2 doi
035 $a 978-3-030-58892-2
050 4 $a QA166-166.247
072 7 $a PBV $2 bicssc
072 7 $a MAT013000 $2 bisacsh
072 7 $a PBV $2 thema
082 0 4 $a 511.5 $2 23
245 1 0 $a Structures of Domination in Graphs $h [electronic resource] / $c edited by Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a VIII, 536 p. 169 illus., 61 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Developments in Mathematics, $x 2197-795X ; $v 66
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).
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.
650 1 4 $a Graph Theory. $3 786670
650 0 $a Graph theory. $3 527884
700 1 $a Henning, Michael A. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1076051
700 1 $a Hedetniemi, Stephen T. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1210579
700 1 $a Haynes, Teresa W. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1210578
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030588915
776 0 8 $i Printed edition: $z 9783030588939
776 0 8 $i Printed edition: $z 9783030588946
830 0 $a Developments in Mathematics, $x 1389-2177 ; $v 41 $3 1256322
856 4 0 $u https://doi.org/10.1007/978-3-030-58892-2
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)