Topics on domination / [edited by] S.T. Hedetniemi, R.C. Laskar.

Contributor(s):

Series: Annals of discrete mathematics ; 48.1991Description: 1 online resource (280 pages) : illustrationsContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9780444890061
0444890068
9780080867885
008086788X
1281789593
9781281789594

Other title:

Domination

Subject(s):

Genre/Form:

Electronic books.

Additional physical formats: Print version:: Topics on domination.LOC classification:

QA166 .T65 1991eb

Online resources:

Click here to access online

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.

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.

Item type:

eBooks

Average rating: 0.0 (0 votes)

Holdings ( 0 )
Title notes ( 5 )

No physical items for this record

Includes bibliographical references and index.

Print version record.

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.

Elsevier ScienceDirect All Books