2-Domination相关论文
图 G 的 A 2-dominating 集合是 G 的顶点的集合 D 以便 V (G) 的每个顶点|D 在 D 有至少二位邻居。图 G 的一个全部的外部独立人......
A vertex of a graph is said to dominate itself and all of its neighbors.A double dominating set of a graph G is a set D ......
A set D of vertices of a graph G = (V, E) is called k-dominating if every vertex v ∈V-D is adjacent to some k vertices ......
