نتایج جستجو برای: double roman domination number

تعداد نتایج: 1401394  

Journal: :AKCE International Journal of Graphs and Combinatorics 2023

For a graph G=(V,E) with V=V(G) and E=E(G), perfect double Italian dominating function is f:V→{0,1,2,3} having the property that 3≤∑u∈NG[v]f(u)≤4, for every vertex v∈G f(v)∈{0,1}. The weight of f sum f(V)=∑v∈V(G)f(v) minimum on G domination number γdIp(G) G. We initiate study functions. check γdIp some standard graphs evaluate γdI such graphs. functions versus Roman are perused. NP-completeness...

Journal: :Ars Comb. 2018
Polona Repolusk Janez Zerovnik

The existence of a constant time algorithm for solving different domination problems on the subclass of polygraphs, rotagraphs and fasciagraphs, is shown by means of path algebras. As these graphs include products (the Cartesian, strong, direct, lexicographic) of paths and cycles, we implement the algorithm to get formulas in the case of the domination numbers, the Roman domination numbers and ...

Journal: :Discrete Applied Mathematics 2015

Journal: :Tamkang Journal of Mathematics 2017

Journal: :Results in Mathematics 2019

Journal: :Discussiones Mathematicae Graph Theory 2017

Journal: :Discrete Applied Mathematics 2011

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید