Dominating sets for split and bipartite graphs
Author:
- 1 July 1984
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 19 (1) , 37-40
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Contributions to the theory of domination, independence and irredundance in graphsDiscrete Mathematics, 1981
- Total domination in graphsNetworks, 1980
- Graph‐theoretic parameters concerning domination, independence, and irredundanceJournal of Graph Theory, 1979
- Optimum domination in weighted treesInformation Processing Letters, 1978
- On domination and independent domination numbers of a graphDiscrete Mathematics, 1978
- Towards a theory of domination in graphsNetworks, 1977
- R -Domination in GraphsJournal of the ACM, 1976
- Disjoint independent dominating sets in graphsDiscrete Mathematics, 1976
- Optimal domination in graphsIEEE Transactions on Circuits and Systems, 1975
- A linear algorithm for the domination number of a treeInformation Processing Letters, 1975