نتایج جستجو برای: total k rainbow domination number
تعداد نتایج: 2143464 فیلتر نتایج به سال:
2018
Nina Chiarelli
Tatiana Romina Hartinger
Valeria Alejandra Leoni
Maria In'es Lopez Pujato
Martin Milanivc
Given a positive integer k, a k-dominating set in a graph G is a set of vertices such that every vertex not in the set has at least k neighbors in the set. A total k-dominating set, also known as a k-tuple total dominating set, is a set of vertices such that every vertex of the graph has at least k neighbors in the set. The problems of finding the minimum size of a k-dominating, resp. total k-d...
Journal:
:Discussiones Mathematicae Graph Theory
2015
Journal:
:Mathematical Problems in Engineering
2020
Journal:
:Discrete Applied Mathematics
2015
Journal:
:Intelligent Information Management
2009
Journal:
:Pure and Applied Mathematics Quarterly
2017
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید