LEADER 03345nam  2200601Ia 450 
001 9910739424903321
005 20200520144314.0
010   $a1-4614-6525-7
024 7 $a10.1007/978-1-4614-6525-6
035   $a(CKB)2670000000355591
035   $a(EBL)1106256
035   $a(OCoLC)842133290
035   $a(SSID)ssj0000909019
035   $a(PQKBManifestationID)11549240
035   $a(PQKBTitleCode)TC0000909019
035   $a(PQKBWorkID)10912455
035   $a(PQKB)11297936
035   $a(DE-He213)978-1-4614-6525-6
035   $a(MiAaPQ)EBC1106256
035   $a(PPN)169136337
035   $a(EXLCZ)992670000000355591
100   $a20111102d2013      uy         0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 10$aTotal domination in graphs /$fMichael A. Henning, Anders Yeo
205   $a1st ed. 2013.
210   $aNew York $cSpringer Science$d2013
215   $a1 online resource (184 p.)
225 0 $aSpringer monographs in mathematics
300   $aDescription based upon print version of record.
311 0 $a1-4899-9156-5 
311 0 $a1-4614-6524-9 
320   $aIncludes bibliographical references and index.
327   $a1. 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.
330   $aTotal 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.
410  0$aSpringer Monographs in Mathematics,$x1439-7382
606   $aGraph theory
606   $aCombinatorial analysis
615  0$aGraph theory.
615  0$aCombinatorial analysis.
676   $a511.5
700   $aHenning$b Michael A$0853538
701   $aYeo$b Anders$01254922
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910739424903321
996   $aTotal domination in graphs$94197860
997   $aUNINA