On Dominating Sets and Independent Sets of Graphs

Combinatorics Probability and Computing

Volumn 8, Issue 6, 1999, Pages 547-553

  Harant, Jochen ^a   Pruchnewski, Anja ^a   Voigt, Margit ^a  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033274677     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548399004034     Document Type: Article

References (11)

1. Alon, N., Spencer, J. H. and Erdos, P. (1992) The Probabilistic Method, Wiley.
2. Bean, T. J., Henning, M. A. and Swart, H. C. (1994) On the integrity of distance domination in graphs. Australas. J. Combin. 10 29-43.
3. Caro, Y. and Tuza, Zs. (1991) Improved lower bounds on k-independence. J. Graph Theory 15 99-107.
4. Cockayne, E. J., Gamble, B. and Shepherd, B. (1985) An upper bound for the k-domination number of a graph. J. Graph Theory 9 533-534.
5. Favaron, O. (1985) On a conjecture of Fink and Jacobson concerning k-domination and k-dependence. J. Combin. Theory Ser. B 39 101-102.
6. Favaron, O. (1988) k-domination and k-dependence in graphs. Ars Combin. 25C 156-167.
7. Fink, J. F. and Jacobson, M. S. (1985) n-domination in graphs. In Graph Theory with Applications to Algorithms and Computer Science: Proceedings of the 5th International Conference, Kalamazoo (1984), Wiley, New York, pp. 283-300.
8. Fink, J. F. and Jacobson, M. S. (1985) On n-domination, n-dependence and forbidden subgraphs. In Graph Theory with Applications to Algorithms and Computer Science: Proceedings of the 5th International Conference, Kalamazoo (1984), Wiley, New York, pp. 301-311.
9. Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco.
10. Stracke, C. and Volkmann, L. (1993) A new domination conception. J. Graph Theory 17 315-323.
11. Volkmann, L. (1996) Fundamente der Graphentheorie, Springer.