Fundamentals of domination in graphs
著者
書誌事項
Fundamentals of domination in graphs
（Monographs and textbooks in pure and applied mathematics, 208）
Marcel Dekker, c1998
大学図書館所蔵 件 / 全52件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 355-438) and index
内容説明・目次
内容説明
"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.
「Nielsen BookData」 より