Zobrazeno 1 - 2
of 2
pro vyhledávání: '"O5C69"'
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
Autor:
Abel Cabrera Martínez
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49bf554f911239fae9df67a770787e98