Let G be a graph and F a family of graphs. A transversal of F is a set X of vertices of G such that Gâˆ’X contains no member of F . The family F is said to have the ErdÅ‘sâ€“PÃ³sa property if there existsâ€¦ (More)

For a positive integer k, a k-rainbow dominating function of a graph G is a function f from the vertex set V (G) to the set of all subsets of the set {1, 2, . . . , k} such that for any vertex v âˆˆ Vâ€¦ (More)

A set D âŠ† V of vertices is said to be a (connected) distance k-dominating set of G if the distance between each vertex u âˆˆ V âˆ’ D and D is at most k (and D induces a connected graph in G). The minimumâ€¦ (More)

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â€¦ (More)

A digraph without loops, multiple arcs and directed cycles of length two is called a local tournament if the set of in-neighbors as well as the set of out-neighbors of every vertex induces aâ€¦ (More)