Let G = (V ,E) be a graph without isolated vertices. A set S âŠ† V is a paired-dominating set if every vertex in V âˆ’ S is adjacent to a vertex in S and the subgraph induced by S contains a perfectâ€¦ (More)

For given positive integers j â‰¥ k, an L( j, k)-labeling of a graph G is a function f : V (G) â†’ {0, 1, 2, . . .} such that | f (u) âˆ’ f (v)| â‰¥ j when dG (u, v) = 1 and | f (u) âˆ’ f (v)| â‰¥ k when dG (u,â€¦ (More)

Prostate cancer is a type of cancer that occurs in the male prostate, a gland in the male reproductive system. Because prostate cancer cells may spread to other parts of the body and can influenceâ€¦ (More)

Let G = (V , E) be a simple graph without isolated vertices. A vertex set S âŠ† V is a paireddominating set if every vertex in V âˆ’ S has a neighbor in S and the induced subgraph G[S] has aâ€¦ (More)

Let G = (V , E) be a graph without isolated vertices. For a positive integer k, a set S âŠ† V is a k-distance paired-dominating set if each vertex in V âˆ’S is within distance k of a vertex in S and theâ€¦ (More)

In this paper, we show that: (i) For n-dimensional undirected binary de Bruijn graphs, UB(n), nÂ¿4, there is a vertex x=x1 x1 x1 Â· Â· Â· x1x1 (x1=1 or 0) such that for any other vertex t there exist atâ€¦ (More)

In this paperwe consider the pos/neg-weightedmedian problem on a tree graphwhere the customers aremodeled as continua subtrees.We address the discrete and continuousmodels, i.e., the subtreesâ€™â€¦ (More)