Fundamentals of domination in graphs

Author(s)

• Haynes, Teresa W.
• Hedetniemi, S. T.
• Slater, Peter J

Bibliographic Information

Fundamentals of domination in graphs

Teresa W. Haynes, Stephen T. Hedetniemi, Peter J. Slater

（Monographs and textbooks in pure and applied mathematics, 208）

Marcel Dekker, c1998

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"

Details

• NCID: BA34167248
• ISBN:
  • 0824700333
• LCCN: 97043490
• Country Code: us
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: New York
• Pages/Volumes: xi, 446 p.
• Size: 24 cm
• Classification:
  • LCC : QA166
  • DC21 : 511/.5
  • NDC8 : 415.7
• Subject Headings:
  • LCSH : Domination (Graph theory)
• Parent Bibliography ID:
  • BA00046446