Zobrazeno 1 - 3
of 3
pro vyhledávání: '"H. R. Maimani"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 905-910 (2020)
For a graph G = (V,E), a double Roman dominating function has the property that for every vertex with f(v) = 0, either there exists a vertex , with f(u) = 3, or at least two neighbors having f(x) = f(y) = 2, and every vertex with value 1 under f has
Externí odkaz:
https://doaj.org/article/fe4912e176e9483dad1ace5a1b78811e
Publikováno v:
AKCE International Journal of Graphs and Combinatorics. 19:36-40
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 14
For a graph [Formula: see text], a double Roman dominating function (DRDF) is a function [Formula: see text] having the property that if [Formula: see text] for some vertex [Formula: see text], then [Formula: see text] has at least two neighbors assi