排序方式: 共有1条查询结果,搜索用时 15 毫秒
1
1.
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. 相似文献
1