Facebook Instagram Twitter RSS Feed PodBean Back to top on side

On restricted domination in graphs

In: Mathematica Slovaca, vol. 57, no. 5
Vladimir Samodivkin

Details:

Year, pages: 2007, 401 - 406
About article:
The $k$-restricted domination number of a graph $G$ is the minimum number $dk$ such that for any subset $U$ of $k$ vertices of $G$, there is a dominating set in $G$ including $U$ and having at most $dk$ vertices. Some new upper bounds in terms of order and degrees for this number are found.
How to cite:
ISO 690:
Samodivkin, V. 2007. On restricted domination in graphs. In Mathematica Slovaca, vol. 57, no.5, pp. 401-406. 0139-9918.

APA:
Samodivkin, V. (2007). On restricted domination in graphs. Mathematica Slovaca, 57(5), 401-406. 0139-9918.