---

＜電子ブック＞
Total Domination in Graphs / by Michael A. Henning, Anders Yeo
(Springer Monographs in Mathematics. ISSN:21969922)

版	1st ed. 2013.
出版者	(New York, NY : Springer New York : Imprint: Springer)
出版年	2013
本文言語	英語
大きさ	XIV, 178 p : online resource
著者標目	*Henning, Michael A author Yeo, Anders author SpringerLink (Online service)
件　名	LCSH:Graph theory LCSH:Mathematical analysis LCSH:Number theory FREE:Graph Theory FREE:Analysis FREE:Number Theory
一般注記	1. Introduction -- 2. Properties of Total Dominating Sets and General Bounds -- 3. Complexity and Algorithmic Results -- 4.Total Domination in Trees -- 5.Total Domination and Minimum Degree -- 6. Total Domination in Planar Graphs -- 7. Total Domination and Forbidden Cycles -- 8. Relating the Size and Total Domination Number -- 9. Total Domination in Claw-Free Graphs -- 10. Total Domination Number versus Matching Number -- 11. Total Domination Critical Graphs -- 12. Total Domination and Graph Products -- 13. Graphs with Disjoint Total Dominating Sets -- 14. Total Domination in Graphs with Diameter Two -- 15. Nordhaus-Gaddum Bounds for Total Domination -- 16. Upper Total Domination -- 17.Variations of Total Domination -- 18. Conjectures and Open Problems -- Index Total Domination in Graphs gives a clear understanding  of this topic to any interested reader who has a modest background in graph theory. This book provides and explores the fundamentals of total domination in graphs. Some of the topics featured include the interplay between total domination in graphs and transversals in hypergraphs, and the association with total domination in graphs and diameter-2-critical graphs. Several proofs are included in this text which enables readers to acquaint themselves with a toolbox of proof techniques and ideas with which to attack open problems in the field. This work is  an excellent resource for students interested in beginning their research in this field.  Additionally, established researchers will find the book valuable to have as it contains the latest developments and open problems HTTP:URL=https://doi.org/10.1007/978-1-4614-6525-6

 類似資料