نتایج جستجو برای: totally
تعداد نتایج: 28849 فیلتر نتایج به سال:
Journal:
:Ars Mathematica Contemporanea
2021
A subset of vertices in a graph is called total dominating set if every vertex the adjacent to at least one this set. minimal it does not properly contain another In paper, we study graphs whose all sets have same size, referred as well-totally-dominated (WTD) graphs. We first show that WTD with bounded domination number can be recognized polynomial time. Then focus on two. case, characterize t...
Journal:
:Bulletin of the American Mathematical Society
1958
Journal:
:Transactions of the American Mathematical Society
1974
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید