On Dominating Sets And Independent Sets Of Graphs

@article{Harant1999OnDS,
  title={On Dominating Sets And Independent Sets Of Graphs},
  author={Jochen Harant and Anja Pruchnewski and Margit Voigt},
  journal={Combinatorics, Probability & Computing},
  year={1999},
  volume={8},
  pages={547-553}
}
A k-dominating set is a set D k V such that every vertex i 2 V nD k has at least k i neighbours in D k. The k-domination number k (G) of G is the cardinality of a smallest k-dominating set of G. For k 1 = ::: = kn = 1, k-domination corresponds to the usual concept of domination. Our approach yields an improvement of an upper bound for the domination number found then the notion of k-dominating set corresponds to the complement of an independent set. A function f k (p) is deened, and it will be… CONTINUE READING

From This Paper

Topics from this paper.
34 Citations
12 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 12 references

A new domination conception

  • L. Volkmann C. Stracke
  • J . Graph Theory
  • 1993

Volkmann:A new domination conception

  • L. C. Stracke
  • J. Graph Theory
  • 1993

Erd os: The Probabilistic Method

  • N. Alon, P.J.H. Spencer
  • 1992

Tuza : Improved lower bounds on kindependence

  • Y. Caro, Zs.
  • J . Graph Theory
  • 1991

Favaron : kdomination and kdependence in graphs

  • O.
  • Ars Combin .
  • 1988

Jacobson: On n-domination, n-dependence and forbidden subgraphs, Graph Theory with Applications to Algorithms and Computer Science, Proccedings of the 5th international conference

  • M.S.J.F. Fink
  • Kalamazoo
  • 1984

Similar Papers

Loading similar papers…