Fundamentals of Domination in Graphs

1. Auflage 1998
ISBN: 978-0-8247-0033-1
Verlag: Taylor & Francis Ltd

Buch, Englisch, 464 Seiten, Format (B × H): 153 mm x 235 mm, Gewicht: 685 g

Reihe: Chapman & Hall/CRC Pure and Applied Mathematics

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

Autoren/Hrsg.

Haynes, Teresa W.

Hedetniemi, Stephen

Slater, Peter

Fachgebiete

• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Computeranwendungen in der Mathematik
• Mathematik | Informatik Mathematik Operations Research Graphentheorie

Inhaltsverzeichnis

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.

Über Autor(innen)

Teresa W. Haynes, Stephen Hedetniemi, Peter Slater