東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Domination in graphs = core concepts /

Haynes, Teresa W.

FindBook

Google Book

Amazon

博客來

Domination in graphs = core concepts /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Domination in graphs/ by Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning.
其他題名:	core concepts /
作者:	Haynes, Teresa W.
其他作者:	Hedetniemi, S. T.
出版者:	Cham :Springer International Publishing : : 2023.,
面頁冊數:	xx, 644 p. :ill., digital ;24 cm.
內容註:	1. Introduction -- 2. Historic background -- 3. Domination Fundamentals -- 4. Bounds in terms of order and size, and probability -- 5. Bounds in terms of degree -- 6. Bounds with girth and diameter conditions -- 7. Bounds in terms of forbidden subgraphs -- 8. Domination in graph families : Trees -- 9. Domination in graph families: Claw-free graphs -- 10. Domination in regular graphs including Cubic graphs -- 11. Domination in graph families: Planar graph -- 12. Domination in graph families: Chordal, bipartite, interval, etc -- 13. Domination in grid graphs and graph products -- 14. Progress on Vizing's Conjecture -- 15. Sums and Products (Nordhaus-Gaddum) -- 16. Domination Games -- 17. Criticality -- 18. Complexity and Algorithms -- 19. The Upper Domination Number -- 20. Domatic Numbers (for lower and upper gamma) and other dominating partitions, including the newly introduced Upper Domatic Number -- 21. Concluding Remarks, Conjectures, and Open Problems.
Contained By:	Springer Nature eBook
標題:	Domination (Graph theory) -
電子資源:	https://doi.org/10.1007/978-3-031-09496-5
ISBN:	9783031094965

Domination in graphs = core concepts /
Haynes, Teresa W.

Domination in graphscore concepts /[electronic resource] :by Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning. - Cham :Springer International Publishing :2023. - xx, 644 p. :ill., digital ;24 cm. - Springer monographs in mathematics,2196-9922. - Springer monographs in mathematics..

1. Introduction -- 2. Historic background -- 3. Domination Fundamentals -- 4. Bounds in terms of order and size, and probability -- 5. Bounds in terms of degree -- 6. Bounds with girth and diameter conditions -- 7. Bounds in terms of forbidden subgraphs -- 8. Domination in graph families : Trees -- 9. Domination in graph families: Claw-free graphs -- 10. Domination in regular graphs including Cubic graphs -- 11. Domination in graph families: Planar graph -- 12. Domination in graph families: Chordal, bipartite, interval, etc -- 13. Domination in grid graphs and graph products -- 14. Progress on Vizing's Conjecture -- 15. Sums and Products (Nordhaus-Gaddum) -- 16. Domination Games -- 17. Criticality -- 18. Complexity and Algorithms -- 19. The Upper Domination Number -- 20. Domatic Numbers (for lower and upper gamma) and other dominating partitions, including the newly introduced Upper Domatic Number -- 21. Concluding Remarks, Conjectures, and Open Problems.

This monograph is designed to be an in-depth introduction to domination in graphs. It focuses on three core concepts: domination, total domination, and independent domination. It contains major results on these foundational domination numbers, including a wide variety of in-depth proofs of selected results providing the reader with a toolbox of proof techniques used in domination theory. Additionally, the book is intended as an invaluable reference resource for a variety of readerships, namely, established researchers in the field of domination who want an updated, comprehensive coverage of domination theory; next, researchers in graph theory who wish to become acquainted with newer topics in domination, along with major developments in the field and some of the proof techniques used; and, graduate students with interests in graph theory, who might find the theory and many real-world applications of domination of interest for masters and doctoral thesis topics. The focused coverage also provides a good basis for seminars in domination theory or domination algorithms and complexity. The authors set out to provide the community with an updated and comprehensive treatment on the major topics in domination in graphs. And by Jove, they've done it! In recent years, the authors have curated and published two contributed volumes: Topics in Domination in Graphs, © 2020 and Structures of Domination in Graphs, © 2021. This book rounds out the coverage entirely. The reader is assumed to be acquainted with the basic concepts of graph theory and has had some exposure to graph theory at an introductory level. As graph theory terminology sometimes varies, a glossary of terms and notation is provided at the end of the book.

ISBN: 9783031094965

Standard No.: 10.1007/978-3-031-09496-5doiSubjects--Topical Terms:

2012822
Domination (Graph theory)

LC Class. No.: QA166 / .H39 2023

Dewey Class. No.: 511.5

Domination in graphs = core concepts /
LDR:03775nmm a2200337 a 4500 001 2317854
003 DE-He213
005 20230429094711.0
006 m d
007 cr nn 008maaau
008 230902s2023 sz s 0 eng d
020 $a 9783031094965 $q (electronic bk.)
020 $a 9783031094958 $q (paper)
024 7 $a 10.1007/978-3-031-09496-5 $2 doi
035 $a 978-3-031-09496-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166 $b .H39 2023
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 .H424 2023
100 1 $a Haynes, Teresa W. $3 3494769
245 1 0 $a Domination in graphs $h [electronic resource] : $b core concepts / $c by Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2023.
300 $a xx, 644 p. : $b ill., digital ; $c 24 cm.
490 1 $a Springer monographs in mathematics, $x 2196-9922
505 0 $a 1. Introduction -- 2. Historic background -- 3. Domination Fundamentals -- 4. Bounds in terms of order and size, and probability -- 5. Bounds in terms of degree -- 6. Bounds with girth and diameter conditions -- 7. Bounds in terms of forbidden subgraphs -- 8. Domination in graph families : Trees -- 9. Domination in graph families: Claw-free graphs -- 10. Domination in regular graphs including Cubic graphs -- 11. Domination in graph families: Planar graph -- 12. Domination in graph families: Chordal, bipartite, interval, etc -- 13. Domination in grid graphs and graph products -- 14. Progress on Vizing's Conjecture -- 15. Sums and Products (Nordhaus-Gaddum) -- 16. Domination Games -- 17. Criticality -- 18. Complexity and Algorithms -- 19. The Upper Domination Number -- 20. Domatic Numbers (for lower and upper gamma) and other dominating partitions, including the newly introduced Upper Domatic Number -- 21. Concluding Remarks, Conjectures, and Open Problems.
520 $a This monograph is designed to be an in-depth introduction to domination in graphs. It focuses on three core concepts: domination, total domination, and independent domination. It contains major results on these foundational domination numbers, including a wide variety of in-depth proofs of selected results providing the reader with a toolbox of proof techniques used in domination theory. Additionally, the book is intended as an invaluable reference resource for a variety of readerships, namely, established researchers in the field of domination who want an updated, comprehensive coverage of domination theory; next, researchers in graph theory who wish to become acquainted with newer topics in domination, along with major developments in the field and some of the proof techniques used; and, graduate students with interests in graph theory, who might find the theory and many real-world applications of domination of interest for masters and doctoral thesis topics. The focused coverage also provides a good basis for seminars in domination theory or domination algorithms and complexity. The authors set out to provide the community with an updated and comprehensive treatment on the major topics in domination in graphs. And by Jove, they've done it! In recent years, the authors have curated and published two contributed volumes: Topics in Domination in Graphs, © 2020 and Structures of Domination in Graphs, © 2021. This book rounds out the coverage entirely. The reader is assumed to be acquainted with the basic concepts of graph theory and has had some exposure to graph theory at an introductory level. As graph theory terminology sometimes varies, a glossary of terms and notation is provided at the end of the book.
650 0 $a Domination (Graph theory) $3 2012822
650 1 4 $a Graph Theory. $3 1567033
700 1 $a Hedetniemi, S. T. $3 1642263
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 Springer monographs in mathematics. $3 1535313
856 4 0 $u https://doi.org/10.1007/978-3-031-09496-5
950 $a Mathematics and Statistics (SpringerNature-11649)