Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Roman game domination subdivision number"'
Publikováno v:
Transactions on Combinatorics, Vol 2, Iss 4, Pp 1-12 (2013)
A {em Roman dominating function} on a graph $G = (V ,E)$ is a function $f : Vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. The {em weight}
Externí odkaz:
https://doaj.org/article/a969902d590944daac2461adb909ac03