東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Structures of domination in graphs

Haynes, Teresa W.

FindBook

Google Book

Amazon

博客來

Structures of domination in graphs

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Structures of domination in graphs/ edited by Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning.
其他作者:	Haynes, Teresa W.
出版者:	Cham :Springer International Publishing : : 2021.,
面頁冊數:	viii, 536 p. :ill., digital ;24 cm.
內容註:	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)
Contained By:	Springer Nature eBook
標題:	Domination (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. - Cham :Springer International Publishing :2021. - viii, 536 p. :ill., digital ;24 cm. - Developments in mathematics,v.661389-2177 ;. - Developments in mathematics ;v.66..

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:

2012822
Domination (Graph theory)

LC Class. No.: QA166 / .S778 2021

Dewey Class. No.: 511.5

Structures of domination in graphs
LDR:03280nmm a2200337 a 4500 001 2240099
003 DE-He213
005 20210730094737.0
006 m d
007 cr nn 008maaau
008 211111s2021 sz s 0 eng d
020 $a 9783030588922 $q (electronic bk.)
020 $a 9783030588915 $q (paper)
024 7 $a 10.1007/978-3-030-58892-2 $2 doi
035 $a 978-3-030-58892-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166 $b .S778 2021
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
090 $a QA166 $b .S927 2021
245 0 0 $a Structures of domination in graphs $h [electronic resource] / $c edited by Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a viii, 536 p. : $b ill., digital ; $c 24 cm.
490 1 $a Developments in mathematics, $x 1389-2177 ; $v 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 0 $a Domination (Graph theory) $3 2012822
650 1 4 $a Graph Theory. $3 1567033
700 1 $a Haynes, Teresa W. $3 3494769
700 1 $a Hedetniemi, Stephen T. $3 3494770
700 1 $a Henning, Michael A. $3 3461646
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Developments in mathematics ; $v v.66. $3 3494771
856 4 0 $u https://doi.org/10.1007/978-3-030-58892-2
950 $a Mathematics and Statistics (SpringerNature-11649)