The Wiener index of a graph G is the sum of distances between all pairs of its vertices. It is a
widely-used graph property in chemistry, initially introduced to examine the link between …

We consider interprocedural data-flow analysis as formalized by the standard IFDS
framework, which can express many widely-used static analyses such as reaching …

For a graph G, a set D⊆ V (G) is called a [1, j]-dominating set if every vertex in V (G)∖ D has
at least one and at most j neighbors in D. A set D⊆ V (G) is called a [1, j]-total dominating set …

A dominating set is a set S of vertices in a graph such that every vertex not in S is adjacent to
a vertex in S. In this paper, we consider the set of all optimal (ie smallest) dominating sets S …

Abstract A [1, 2]-set of a graph G is a set S of vertices of G if every vertex not in S has one or
two neighbors in S. The [1, 2]-domination number γ [1, 2](G) of G equals the minimum …

A subset D of the vertex set V (G) of a graph G is called a 1, k-dominating set if every vertex
from VD VD is adjacent to at least one vertex and at most k vertices of D. A 1, k-dominating …

A subset S of the vertices of G=(V, E) is an [a, b]-set if for every vertex v not in S we have the
number of neighbors of v in S is between a and b for non-negative integers a and b, that is …

In 2013 the concept of [j, k]-dominating sets in graphs have been introduced as an extension
of [1, k]-dominating sets. Regarding studying [j, k]-dominating sets, the research is also …

Given a graph $ G=(V, E) $ and an integer $ k $, the Minimum Membership Dominating Set
problem asks to compute a set $ S\subseteq V $ such that for each $ v\in V $, $1\leq| N …

A subset $ S $ of vertices in a graph $ G=(V, E) $ is Dominating Set if each vertex in $ V
(G)\setminus S $ is adjacent to at least one vertex in $ S $. Chellali et al. in 2013, by …