Sentence examples for dominating set from inspiring English sources

The minimum capacitated dominating set (CAPMDS) problem is the problem of finding a dominating set of minimum cardinality with the additional constraint that the nodes dominated do not exceed the capacity of the respective dominating nodes.

Minimum connected dominating set.

Wu et al. proposed a protocol which constructed distributed localization of connected dominating set and discussed methods of dominating set coverage with efficient energy.

We provide a complete characterization of circulant graphs with two chord lengths that admit an efficient dominating set.

In a graph G, a vertex subset S⊆V G) is said to be a dominating set of G if every vertex not in S is adjacent to a vertex in S. A dominating set S of a graph G is called a paired-dominating set if the induced subgraph G[S] contains a perfect matching.

We show that by combining H2CM with the concept of dominating set, the communication cost can be drastically reduced compare to traditional data collection method.

In this paper we discuss the process of determining the distance-t dominating set of the extended star graph ES n, k).

The paired-domination problem involves finding a minimum paired-dominating set of G.

The F-domination number γF(G) of G is the minimum cardinality of an F-dominating set.

Every vertex in a minimum distance k-dominating set has a private k-neighbor.

In this paper, we propose the construction of a k-connected k-dominating set (k-CDS) as a backbone to balance efficiency and fault tolerance.