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.
Author(s): S.T. Hedetniemi (Eds.)
Series: Annals of Discrete Mathematics 48
Publisher: Elsevier Science Ltd
Year: 1991
Language: English
Pages: ii-iv, 3-280
Content:
General Editor
Page ii
Edited by
Page iii
Copyright page
Page iv
Introduction
Pages 3-9
S.T. Hedetniemi, R.C. Laskar
Chessboard Domination Problems Original Research Article
Pages 13-20
E.J. Cockayne
On the Queen Domination Problem Original Research Article
Pages 21-26
Charles M. Grinstead, Bruce Hahne, David Van Stone
Recent Problems and Results about Kernels in Directed Graphs Original Research Article
Pages 27-31
C. Berge, P. Duchet
Critical Concepts in Domination Original Research Article
Pages 33-46
David P. Sumner
The Bondage Number of a Graph Original Research Article
Pages 47-57
John Frederick Fink, Michael S. Jacobson, Lael F. Kinch, John Roberts
Chordal Graphs and Upper Irredundance, Upper Domination and Independence Original Research Article
Pages 59-69
Michael S. Jacobson, Ken Peters
Regular Totally Domatically Full Graphs Original Research Article
Pages 71-79
Bohdan Zelinka
Domatically Critical and Domatically Full Graphs Original Research Article
Pages 81-87
Douglas F. Rall
On Generalised Minimal Domination Parameters for Paths Original Research Article
Pages 89-97
B. Bollobás, E.J. Cockayne, C.M. Mynhardt
Dominating Cliques in Graphs Original Research Article
Pages 101-116
Margaret B. Cozzens, Laura L. Kelleher
Covering All Cliques of a Graph Original Research Article
Pages 117-126
Zsolt Tuza
Factor Domination in Graphs Original Research Article
Pages 127-136
Robert C. Brigham, Ronald D. Dutton
The Least Point Covering and Domination Numbers of a Graph Original Research Article
Pages 137-142
E. Sampathkumar
Dominating Sets in Perfect Graphs Original Research Article
Pages 145-164
Derek G. Corneil, Lorna K. Stewart
Unit Disk Graphs Original Research Article
Pages 165-177
Brent N. Clark, Charles J. Colbourn, David S. Johnson
Permutation Graphs: Connected Domination and Steiner Trees Original Research Article
Pages 179-189
Charles J. Colbourn, Lorna K. Stewart
The Discipline Number of a Graph Original Research Article
Pages 191-198
V. Chvátal, W. Cook
Best Location of Service Centers in a Treelike Network Under Budget Constraints Original Research Article
Pages 199-214
James McHugh, Yehoshua Perl
Dominating Cycles in Halin Graphs Original Research Article
Pages 215-224
Mirostawa Skowrońska, Maciej M. SysłO
Finding Dominating Cliques Efficiently, in Strongly Chordal Graphs and Undirected Path Graphs Original Research Article
Pages 225-238
Dieter Kratsch
On Minimum Dominating Sets with Minimum Intersection Original Research Article
Pages 239-254
Dana L. Grinstead, Peter J. Slater
Bibliography on Domination in Graphs and Some Basic Definitions of Domination Parameters Original Research Article
Pages 257-277
S.T. Hedetniemi, R.C. Laskar
Author Index Volume 86 (1990)
Pages 279-280
