نتایج جستجو برای: dominating set
تعداد نتایج: 666360 فیلتر نتایج به سال:
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numbers. We also consider a general framework for constructive characterizations for other equality problems.
In Section 5 of [1], class H2 should be defined as follows: Let H2 be the family of graphs whose vertex set contains a set D that induces a star K1,r (with r ≥ 1), of center vertex x and leaves x1, . . . , xr, such that: for every vertex u of V (G) − D, N(u) is equal to either {x1, x2} or {x, xi} for some i ∈ {1, . . . , r}; moreover, if any vertex z of V (G)−D satisfies N(z) = {x1, x2}, then n...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید