50 research outputs found
On the structure of dominating graphs
The -dominating graph of a graph is defined on the vertex set
consisting of dominating sets of with cardinality at most , two such
sets being adjacent if they differ by either adding or deleting a single
vertex. A graph is a dominating graph if it is isomorphic to for some
graph and some positive integer . Answering a question of Haas and
Seyffarth for graphs without isolates, it is proved that if is such a graph
of order and with , then and for
some . It is also proved that for a given there exist only a finite
number of -regular, connected dominating graphs of connected graphs. In
particular, and are the only dominating graphs in the class of
cycles. Some results on the order of dominating graphs are also obtained.Comment: 8 pages, 1 figur
Uniform Length Dominating Sequence Graphs
A sequence of vertices of a graph is called a
{\it dominating closed neighborhood sequence} if is
a dominating set of and for
every . A graph is said to be {\it uniform} if all dominating closed
neighborhood sequences have equal length . Bre{\v s}ar et al. (2014)
characterized -uniform graphs with . In this article we extend
their work by giving a complete characterization of all -uniform graphs with
.Comment: 7 page
Domination games played on line graphs of complete multipartite graphs
The domination game on a graph (introduced by B. Bre\v{s}ar, S.
Klav\v{z}ar, D.F. Rall \cite{BKR2010}) consists of two players, Dominator and
Staller, who take turns choosing a vertex from such that whenever a vertex
is chosen by either player, at least one additional vertex is dominated.
Dominator wishes to dominate the graph in as few steps as possible, and Staller
wishes to delay this process as much as possible. The game domination number
is the number of vertices chosen when Dominator
starts the game; when Staller starts, it is denoted by
In this paper, the domination game on line graph of complete multipartite graph
is considered, the
exact values for game domination numbers are obtained and optimal strategy for
both players is described. Particularly, it is proved that for both when and
when .Comment: 7 page
On the game total domination number
The total domination game is a two-person competitive optimization game,
where the players, Dominator and Staller, alternately select vertices of an
isolate-free graph . Each vertex chosen must strictly increase the number of
vertices totally dominated. This process eventually produces a total dominating
set of . Dominator wishes to minimize the number of vertices chosen in the
game, while Staller wishes to maximize it. The game total domination number of
, , is the number of vertices chosen when Dominator
starts the game and both players play optimally.
Recently, Henning, Klav\v{z}ar, and Rall proved that holds for every graph which is given on vertices such
that every component of it is of order at least ; they also conjectured that
the sharp upper bound would be . Here, we prove that
holds for every which contains no
isolated vertices or isolated edges.Comment: 11 page
Zero forcing number, Grundy domination number, and their variants
This paper presents strong connections between four variants of the zero
forcing number and four variants of the Grundy domination number. These
connections bridge the domination problem and the minimum rank problem. We show
that the Grundy domination type parameters are bounded above by the minimum
rank type parameters. We also give a method to calculate the -Grundy
domination number by the Grundy total domination number, giving some linear
algebra bounds for the -Grundy domination number
Complexity of the Game Domination Problem
The game domination number is a graph invariant that arises from a game,
which is related to graph domination in a similar way as the game chromatic
number is related to graph coloring. In this paper we show that verifying
whether the game domination number of a graph is bounded by a given integer is
PSPACE-complete. This contrasts the situation of the game coloring problem
whose complexity is still unknown.Comment: 14 pages, 3 figure
Cutting Lemma and Union Lemma for the Domination Game
Two new techniques are introduced into the theory of the domination game. The
cutting lemma bounds the game domination number of a partially dominated graph
with the game domination number of suitably modified partially dominated graph.
The union lemma bounds the S-game domination number of a disjoint union of
paths using appropriate weighting functions. Using these tools a conjecture
asserting that the so-called three legged spiders are game domination critical
graphs is proved. An extended cutting lemma is also derived and all game
domination critical trees on 18, 19, and 20 vertices are listed
Dominating sequences under atomic changes with applications in Sierpi\'{n}ski and interval graphs
A sequence of distinct vertices of a graph is called
a legal sequence if for
any . The maximum length of a legal (dominating) sequence in is called
the Grundy domination number of a graph . It is known that
the problem of determining the Grundy domination number is NP-complete in
general, while efficient algorithm exist for trees and some other classes of
graphs. In this paper we find an efficient algorithm for the Grundy domination
number of an interval graph. We also show the exact value of the Grundy
domination number of an arbitrary Sierpi\'{n}ski graph , and present
algorithms to construct the corresponding sequence. These results are obtained
by using the main result of the paper, which are sharp bounds for the Grundy
domination number of a vertex- and edge-removed graph. That is, given a graph
, , and , we prove that and . For each of the bounds there exist
graphs, in which all three possibilities occur for different edges,
respectively vertices.Comment: 15 pages, 4 figure
Progress Towards the Total Domination Game -Conjecture
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 . 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 total dominating set of in which every vertex is totally
dominated by a vertex in . Dominator wishes to minimize the number of
vertices chosen, while Staller wishes to maximize it. The game total domination
number, , of is the number of vertices chosen when
Dominator starts the game and both players play optimally. Henning, Klav\v{z}ar
and Rall [Combinatorica, to appear] posted the -Game Total
Domination Conjecture that states that if is a graph on vertices in
which every component contains at least three vertices, then . In this paper, we prove this conjecture over the
class of graphs that satisfy both the condition that the degree sum of
adjacent vertices in is at least and the condition that no two vertices
of degree are at distance apart in . In particular, we prove that by
adopting a greedy strategy, Dominator can complete the total domination game
played in a graph with minimum degree at least in at most moves.Comment: 14 page
Domination game and minimal edge cuts
In this paper a relationship is established between the domination game and
minimal edge cuts. It is proved that the game domination number of a connected
graph can be bounded above in terms of the size of minimal edge cuts. In
particular, if a minimum edge cut of a connected graph , then
. Double-Staller graphs
are introduced in order to show that this upper bound can be attained for
graphs with a bridge. The obtained results are used to extend the family of
known traceable graphs whose game domination numbers are at most one-half their
order. Along the way two technical lemmas, which seem to be generally
applicable for the study of the domination game, are proved.Comment: 15 pages, 1 figur