|
|||||
|
|
Two Bounds for the Domination Number of a Graph |
|
| Authors: | NIEMINEN J |
| Institution: | Department of Technical Sciences, Finnish Academy Lauttasaarentie 1, 00200 Helsinki 20, Finland |
| Abstract: | Upper and lower bounds are obtained for the domination numberof a graph, by means of a lemma involving the concept of a minimumdominating set of vertices. Although these results are obtainedexplicitly for graphs, there are analogous results in the theoryof directed graphs. |
| Keywords: | |
| 本文献已被 Oxford 等数据库收录！ | |