Maximal matching and edge domination in complete multipartite graphs Wenyao Song, Lianying Miao, Haichao Wang & Yancai Zhao a Department of Mathematics, China University of Mining and Technology,â€¦ (More)

A set S of vertices in a graph G = (V,E) is called a total k-distance dominating set if every vertex in V is within distance k of a vertex in S. A graph G is total k-distance domination-critical if Î³â€¦ (More)

The k-distance domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or within distance k from some vertex of D, where k is a positiveâ€¦ (More)

The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by usingâ€¦ (More)