On domination related concepts in Graph Theory
- 1 January 1981
- book chapter
- Published by Springer Nature
- p. 308-320
- https://doi.org/10.1007/bfb0092276
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Graph‐theoretic parameters concerning domination, independence, and irredundanceJournal of Graph Theory, 1979
- Domination of undirected graphs — A surveyLecture Notes in Mathematics, 1978
- On domination and independent domination numbers of a graphDiscrete Mathematics, 1978
- Towards a theory of domination in graphsNetworks, 1977
- Disjoint independent dominating sets in graphsDiscrete Mathematics, 1976
- Traversability and connectivity of the middle graph of a graphDiscrete Mathematics, 1976
- Relations between packing and covering numbers of a treePacific Journal of Mathematics, 1975
- Two Bounds for the Domination Number of a GraphIMA Journal of Applied Mathematics, 1974
- On covering sets and error-correcting codesJournal of Combinatorial Theory, Series A, 1971
- Bottleneck extremaJournal of Combinatorial Theory, 1970