Zobrazeno 1 - 10
of 143
pro vyhledávání: '"Bujtàs, Csilla"'
Let $G$ be a connected graph and $\cal X \subseteq V(G)$. By definition, two vertices $u$ and $v$ are $\cal X$-visible in $G$ if there exists a shortest $u,v$-path with all internal vertices being outside of the set $\cal X$. The largest size of $\ca
Externí odkaz:
http://arxiv.org/abs/2403.15645
Motivated by the success of domination games and by a variation of the coloring game called the indicated coloring game, we introduce a version of domination games called the indicated domination game. It is played on an arbitrary graph $G$ by two pl
Externí odkaz:
http://arxiv.org/abs/2310.14647
If $G$ is a graph and $X\subseteq V(G)$, then $X$ is a total mutual-visibility set if every pair of vertices $x$ and $y$ of $G$ admits a shortest $x,y$-path $P$ with $V(P) \cap X \subseteq \{x,y\}$. The cardinality of a largest total mutual-visibilit
Externí odkaz:
http://arxiv.org/abs/2307.05168
A 1-selection $f$ of a graph $G$ is a function $f: V(G)\rightarrow E(G)$ such that $f(v)$ is incident to $v$ for every vertex $v$. The 1-removed $G_f$ is the graph $(V(G),E(G)\setminus f[V(G)])$. The (1-)robust chromatic number $\chi_1(G)$ is the min
Externí odkaz:
http://arxiv.org/abs/2305.01927
Let $G$ be a graph. A dominating set $D\subseteq V(G)$ is a super dominating set if for every vertex $x\in V(G) \setminus D$ there exists $y\in D$ such that $N_G(y)\cap (V(G)\setminus D)) = \{x\}$. The cardinality of a smallest super dominating set o
Externí odkaz:
http://arxiv.org/abs/2302.08862
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 25:2, Graph Theory (September 6, 2023) dmtcs:10515
In the Maker-Breaker domination game played on a graph $G$, Dominator's goal is to select a dominating set and Staller's goal is to claim a closed neighborhood of some vertex. We study the cases when Staller can win the game. If Dominator (resp., Sta
Externí odkaz:
http://arxiv.org/abs/2212.06530
We study a recently introduced two-person combinatorial game, the $(a,b)$-monochromatic clique transversal game which is played by Alice and Bob on a graph $G$. As we observe, this game is equivalent to the $(b,a)$-biased Maker-Breaker game played on
Externí odkaz:
http://arxiv.org/abs/2207.03203
Autor:
Bujtás, Csilla, Dokyeesun, Pakanun
The Maker-Breaker domination game is played on a graph $G$ by two players, called Dominator and Staller, who alternately choose a vertex that has not been played so far. Dominator wins the game if his moves form a dominating set. Staller wins if she
Externí odkaz:
http://arxiv.org/abs/2206.12812
Publikováno v:
In Discrete Mathematics September 2024 347(9)
Publikováno v:
In Discrete Mathematics January 2025 348(1)