Topics on domination /
The contributions in this volume are divided into three sections: theoretical, new models and algorithmic. The first section focuses on properties of the standard domination number & ggr;(G), the second section is concerned with new variations on the domination theme, and the third is primarily...
Saved in:
Corporate Authors: | |
---|---|
Group Author: | ; |
Published: |
North-Holland ; Sole distributors for the USA and Canada, Elsevier Science,
|
Publisher Address: | Amsterdam ; New York : New York, NY, USA : |
Publication Dates: | 1991. |
Literature type: | eBook |
Language: | English |
Series: |
Annals of discrete mathematics ;
48 |
Subjects: | |
Online Access: |
http://www.sciencedirect.com/science/bookseries/01675060/48 |
Summary: |
The contributions in this volume are divided into three sections: theoretical, new models and algorithmic. The first section focuses on properties of the standard domination number & ggr;(G), the second section is concerned with new variations on the domination theme, and the third is primarily concerned with finding classes of graphs for which the domination number (and several other domination-related parameters) can be computed in polynomial time. |
Carrier Form: | 1 online resource (280 pages) : illustrations. |
Bibliography: | Includes bibliographical references and index. |
ISBN: |
9780444890061 0444890068 9780080867885 008086788X 1281789593 9781281789594 |
Index Number: | QA166 |
CLC: | O157.5 |
Contents: | Front Cover; Topics on Domination; Copyright Page; Contents; Part I: Introduction; Chapter 1. Introduction; Part II: Theoretical; Chapter 2. Chessboard domination problems; Chapter 3. On the queen domination problem; Chapter 4. Recent problems and results about kernels in directed graphs; Chapter 5. Critical concepts in domination; Chapter 6. The bondage number of a graph; Chapter 7. Chordal graphs and upper irredundance, upper domination and independence; Chapter 8. Regular totally domatically full graphs; Chapter 9. Domatically critical and domatically full graphs. |