A dominating set of a graph is a vertex subset that any vertex belongs to or is adjacent to. Among the many well-studied variants of domination are the so-called paired-dominating sets. A paired-dominating set is a dominating set whose induced subgraph has a perfect matching. In this paper, we continue their study. We focus on graphs that do not contain the net-graph (obtained by attaching a pe...

The domination game is played on a graph G by two players, named Dominator and Staller. They alternatively select vertices of G such that each chosen vertex enlarges the set of vertices dominated before the move on it. Dominator’s goal is that the game is finished as soon as possible, while Staller wants the game to last as long as possible. It is assumed that both play optimally. Game 1 and Ga...

In this paper, we continue the study of the total domination game in graphs introduced in [Graphs Combin. 31(5) (2015), 1453–1462], where the players Dominator and Staller alternately select vertices of G. Each vertex chosen must strictly increase the number of vertices totally dominated, where a vertex totally dominates another vertex if they are neighbors. This process eventually produces a t...

In a graph G, a vertex subset S ⊆ V (G) is said to be a dominating set of G if every vertex not in S is adjacent to a vertex in S. A dominating set S of a graph G is called a paired-dominating set if the induced subgraph G[S] contains a perfect matching. The paired-domination problem involves finding a smallest paired-dominating set of G. Given an intersection model of an interval graph G with ...

In this paper, we consider cooperative games arising from integer domination problem on graphs. We introduce two games, {k}-domination game and its monotonic relaxed game, and focus on their cores. We first give characterizations of the cores and the relationship between them. Furthermore, a common necessary and sufficient condition for the balancedness of both games is obtained by making use o...