k-tuple domination in graphs
Authors:
- Chung-Shou LiaoCLChung-Shou Liao
- Gerard J. ChangGCGerard J. Chang
- 1 July 2003
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 87 (1) , 45-50
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Nordhaus-Gaddum inequalities for domination in graphsDiscrete Mathematics, 1996
- The edge domination problemDiscussiones Mathematicae Graph Theory, 1995
- Doubly lexical ordering of dense 0–1 matricesInformation Processing Letters, 1993
- Labeling algorithms for domination problems in sun-free chordal graphsDiscrete Applied Mathematics, 1988
- Totally-Balanced and Greedy MatricesSIAM Journal on Algebraic Discrete Methods, 1985
- Characterizations of totally balanced matricesJournal of Algorithms, 1984
- Domination, independent domination, and duality in strongly chordal graphsDiscrete Applied Mathematics, 1984
- Edge Dominating Sets in GraphsSIAM Journal on Applied Mathematics, 1980
- R -Domination in GraphsJournal of the ACM, 1976
- A linear algorithm for the domination number of a treeInformation Processing Letters, 1975