Fundamentals of Domination in Graphs | Teresa W. Haynes, Stephen Hedet

ABSTRACT

"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."

chapter |14 pages

Prolegomenon

chapter 1|26 pages

Introduction

chapter 2|26 pages

Bounds on the Domination Number

chapter 3|40 pages

Domination, Independence, and Irredundance

chapter 4|28 pages

Efficiency, Redundancy, and Their Duals

chapter 5|20 pages

Changing and Unchanging Domination

chapter 6|28 pages

Conditions on the Dominating Set

chapter 7|36 pages

Varieties of Domination

chapter 8|18 pages

Multiproperty and Multiset Parameters

chapter 9|18 pages

Sums and Products of Parameters

chapter 10|26 pages

Dominating Functions

chapter 11|18 pages

Frameworks for Domination

chapter 12|28 pages

Domination Complexity and Algorithms