Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Martinez, A. Cabrera"'
For a given graph $G$ without isolated vertex we consider a function $f: V(G) \rightarrow \{0,1,2\}$. For every $i\in \{0,1,2\}$, let $V_i=\{v\in V(G):\; f(v)=i\}$. The function $f$ is known to be an outer-independent total Roman dominating function
Externí odkaz:
http://arxiv.org/abs/2112.05476
Let $G$ be a graph of order $n(G)$ and vertex set $V(G)$. Given a set $S\subseteq V(G)$, we define the external neighbourhood of $S$ as the set $N_e(S)$ of all vertices in $V(G)\setminus S$ having at least one neighbour in $S$. The differential of $S
Externí odkaz:
http://arxiv.org/abs/2105.13438
Given a graph $G$ and a subset of vertices $D\subseteq V(G)$, the external neighbourhood of $D$ is defined as $N_e(D)=\{u\in V(G)\setminus D:\, N(u)\cap D\ne \varnothing\}$, where $N(u)$ denotes the open neighbourhood of $u$. Now, given a subset $D\s
Externí odkaz:
http://arxiv.org/abs/2105.12557
Let $G$ be a graph with vertex set $V(G)$. A function $f:V(G)\rightarrow \{0,1,2\}$ is a Roman dominating function on $G$ if every vertex $v\in V(G)$ for which $f(v)=0$ is adjacent to at least one vertex $u\in V(G)$ such that $f(u)=2$. The Roman domi
Externí odkaz:
http://arxiv.org/abs/2105.10006
Let $w=(w_0,w_1, \dots,w_l)$ be a vector of nonnegative integers such that $ w_0\ge 1$. Let $G$ be a graph and $N(v)$ the open neighbourhood of $v\in V(G)$. We say that a function $f: V(G)\longrightarrow \{0,1,\dots ,l\}$ is a $w$-dominating function
Externí odkaz:
http://arxiv.org/abs/2105.05199
Autor:
Martinez, Abel Cabrera
In a graph $G$, a vertex dominates itself and its neighbours. A set $D\subseteq V(G)$ is said to be a $k$-tuple dominating set of $G$ if $D$ dominates every vertex of $G$ at least $k$ times. The minimum cardinality among all $k$-tuple dominating sets
Externí odkaz:
http://arxiv.org/abs/2104.03172
Recently, Haynes, Hedetniemi and Henning published the book Topics in Domination in Graphs, which comprises 16 contributions that present advanced topics in graph domination, featuring open problems, modern techniques, and recent results. One of thes
Externí odkaz:
http://arxiv.org/abs/2102.10584
Given a graph $G=(V,E)$, a function $f:V\rightarrow \{0,1,2\}$ is a total Roman $\{2\}$-dominating function if: (1) every vertex $v\in V$ for which $f(v)=0$ satisfies that $\sum_{u\in N(v)}f(u)\geq 2$, where $N(v)$ represents the open neighborhood of
Externí odkaz:
http://arxiv.org/abs/2101.02537
Publikováno v:
Fundamenta Informaticae, Volume 185, Issue 3 (May 6, 2022) fi:7053
The aim of this paper is to obtain closed formulas for the perfect domination number, the Roman domination number and the perfect Roman domination number of lexicographic product graphs. We show that these formulas can be obtained relatively easily f
Externí odkaz:
http://arxiv.org/abs/2101.02023
In this paper, we show that the Italian domination number of every lexicographic product graph $G\circ H$ can be expressed in terms of five different domination parameters of $G$. These parameters can be defined under the following unified approach,
Externí odkaz:
http://arxiv.org/abs/2011.05371