A subset D of the vertex set of a graph G is a (k, p)-dominating set if every vertex v ∈ V (G) \ D is within distance k to at least p vertices in D. The parameter γk,p(G) denotes the minimum cardinality of a (k, p)-dominating set of G. In 1994, Bean, Henning and Swart posed the conjecture that γk,p(G) ≤ p p+k n(G) for any graph G with δk(G) ≥ k + p − 1, where the latter means that every vertex ...

In this paper, we consider a class of connected oriented (with respect to Z/p) closed G-manifolds with a non-empty finite fixed point set, each of which is G-equivariantly formal, where G = Z/p and p is an odd prime. Using localization theorem and equivariant index, we give an explicit description of the mod p equivariant cohomology ring of such a G-manifold in terms of algebra. This makes ...

In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...

We present an efficient structure from motion algorithm that can deal with large image collections in a fraction of time and effort of previous approaches while providing comparable quality of the scene and camera reconstruction. First, we employ fast image indexing using large image vocabularies to measure visual overlap of images without running actual image matching. Then, we select a small ...

In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is more suitable for cluster formation is the weakly-connected dominating set (WCDS). We propose an area based distributed algorithm for WCDS formation with time and message complexity O(n). In this Area algorithm, we part...

Existing node deployment algorithms for underwater sensor networks are nearly unable to improve the network coverage rate under the premise of ensuring the full network connectivity and do not optimize the communication and move energy consumption during the deployment. Hence, a node deployment algorithm based on connected dominating set (CDS) is proposed. After randomly sowing the nodes in 3D ...