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.