Fundamentals of domination in graphs
Author(s)
Bibliographic Information
Fundamentals of domination in graphs
(Monographs and textbooks in pure and applied mathematics, 208)
Marcel Dekker, c1998
Available at / 52 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 355-438) and index
Description and Table of Contents
Description
"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."
Table of Contents
- 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.
by "Nielsen BookData"