Independent domination in chordal graphs
Author:
- Martin FarberMFMartin Farber
- 1 September 1982
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 1 (4) , 134-138
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Domination, independent domination, and duality in strongly chordal graphsDiscrete Applied Mathematics, 1984
- Graph‐theoretic parameters concerning domination, independence, and irredundanceJournal of Graph Theory, 1979
- Optimum domination in weighted treesInformation Processing Letters, 1978
- Towards a theory of domination in graphsNetworks, 1977
- R -Domination in GraphsJournal of the ACM, 1976
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- A linear algorithm for the domination number of a treeInformation Processing Letters, 1975
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970