نتایج جستجو برای: total domination
تعداد نتایج: 806357 فیلتر نتایج به سال:
Journal:
:European Journal of Pure and Applied Mathematics
2021
Journal:
:Discrete Optimization
2012
Journal:
:Communications of the Korean Mathematical Society
2014
Journal:
:International Journal of Pure and Apllied Mathematics
2016
Journal:
:Mathematical Problems in Engineering
2020
2004
Maciej Zwierzchowski
Let G = (V,E) be a graph. A subset D ⊆ V is a total dominating set of G if for every vertex y ∈ V there is a vertex x ∈ D with xy ∈ E. A subset D ⊆ V is a strong dominating set of G if for every vertex y ∈ V − D there is a vertex x ∈ D with xy ∈ E and deg G (x) ≥ deg G (y). The total domination number γt(G) (the strong domination number γS(G)) is defined as the minimum cardinality of a total do...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید