On restricted domination in graphs |
| |
| Authors: | Vladimir Samodivkin |
| |
| Affiliation: | (1) Department of Mathematics, University of Architecture, Civil Engineering and Geodesy, 1 Hr. Smirnenski Blv., BG-1046 Sofia, Bulgaria |
| |
| Abstract: | ![]()
The k-restricted domination number of a graph G is the minimum number d k such that for any subset U of k vertices of G, there is a dominating set in G including U and having at most d k vertices. Some new upper bounds in terms of order and degrees for this number are found. |
| |
| Keywords: | dominating set restricted domination number |
| 本文献已被 SpringerLink 等数据库收录！ |
|
