نتایج جستجو برای: Roman domination
تعداد نتایج: 20909 فیلتر نتایج به سال:
Journal:
:Discussiones Mathematicae Graph Theory
2020
Journal:
:Discussiones Mathematicae Graph Theory
2017
Journal:
:AKCE International Journal of Graphs and Combinatorics
2020
Journal:
:Australasian J. Combinatorics
2013
Ahmed Bouchou
Mostafa Blidia
For a graph G = (V,E), a Roman dominating function on G is a function f : V (G) → {0, 1, 2} such that every vertex u for which f(u) = 0 is adjacent to at least one vertex v with f(v) = 2. The weight of a Roman dominating function is the value f(V (G)) = ∑ u∈V (G) f(u). The minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G, denoted by γR (G). T...
Journal:
:Discrete Applied Mathematics
2016
Journal:
:Applicable Analysis and Discrete Mathematics
2016
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید