Fundamentals of Domination in Graphs

Front Cover
CRC Press, Jan 5, 1998 - Mathematics - 464 pages
1 Review
"Provides the first comprehensive treatment of theoretical, algorithmic, and application aspects of domination in graphs-discussing fundamental results and major research accomplishments in an easy-to-understand style. Includes chapters on domination algorithms and NP-completeness as well as frameworks for domination."
 

What people are saying - Write a review

User Review - Flag as inappropriate

how to download this book?????????????????????????

Contents

Introduction
15
Bounds on the Domination Number
41
Domination Independence and Irredundance
67
Efficiency Redundancy and Their Duals
107
Changing and Unchanging Domination
135
Conditions on the Dominating Set
155
Varieties of Domination
183
Multiproperty and Multiset Parameters
219
Sums and Products of Parameters
237
Dominating Functions
255
Frameworks for Domination
281
Domination Complexity and Algorithms
299
Copyright

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information