Fundamentals of Domination in Graphs

"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." Bounds on the domination number; domination, independence and irredundance; efficiency, redundancy and the duals; changing and unchanging domination; conditions on the dominating set; varieties of domination; multiproperty and multiset parameters; sums and products of parameters; dominating functions; frameworks for domination; domination complexity and algorithms.