نتایج جستجو برای: double roman domatic number
تعداد نتایج: 1396583 فیلتر نتایج به سال:
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RGGs). In particular, we model these problems as Integer Linear Programs (ILPs), solve them optimally, and show on a large set of samples that RGGs are independent domatically full most likely (over 93% of the cases) and...
Let D be a finite and simple digraph with vertex set V (D). A signed total Roman k-dominating function (STRkDF) on D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) ∑ x∈N−(v) f(x) ≥ k for each v ∈ V (D), where N−(v) consists of all vertices of D from which arcs go into v, and (ii) every vertex u for which f(u) = −1 has an inner neighbor v for which f(v) = 2. The weight o...
Let D be a finite and simple digraph with vertex set V (D) and arc set A(D). A signed Roman dominating function (SRDF) on the digraph D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) ∑ x∈N−[v] f(x) ≥ 1 for each v ∈ V (D), where N −[v] consists of v and all inner neighbors of v, and (ii) every vertex u for which f(u) = −1 has an inner neighbor v for which f(v) = 2. The w...
In this work, we study the signed Roman domination number of the join of graphs. Specially, we determine it for the join of cycles, wheels, fans, and friendship graphs.
We study fractional scheduling problems in sensor networks, in particular, sleep scheduling (generalisation of fractional domatic partition) and activity scheduling (generalisation of fractional graph colouring). The problems are hard to solve in general even in a centralised setting; however, we show that there are practically relevant families of graphs where these problems admit a local dist...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید