Domination, independent domination, and duality in strongly chordal graphs
- 29 February 1984
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 7 (2) , 115-130
- https://doi.org/10.1016/0166-218x(84)90061-1
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Characterizations of totally balanced matricesJournal of Algorithms, 1984
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- Independent domination in chordal graphsOperations Research Letters, 1982
- Dominating Sets in Chordal GraphsSIAM Journal on Computing, 1982
- Optimum domination in weighted treesInformation Processing Letters, 1978
- Towards a theory of domination in graphsNetworks, 1977
- A linear algorithm for the domination number of a treeInformation Processing Letters, 1975
- On balanced matricesPublished by Springer Nature ,1974
- Balanced matricesMathematical Programming, 1972
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970