نتایج جستجو برای: 2 rainbow domination number
تعداد نتایج: 3412189 فیلتر نتایج به سال:
For a positive integer k, a k-rainbow dominating function of a digraph D is a function f from the vertex set V (D) to the set of all subsets of the set {1, 2, . . . , k} such that for any vertex v ∈ V (D) with f(v) = ∅ the condition u∈N−(v) f(u) = {1, 2, . . . , k} is fulfilled, where N−(v) is the set of in-neighbors of v. A set {f1, f2, . . . , fd} of k-rainbow dominating functions on D with t...
A Roman domination function on a graph G is a function r : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of a Roman function is the value r(V (G)) = ∑ u∈V (G) r(u). The Roman domination number γR(G) of G is the minimum weight of a Roman domination function on G . "Roman Criticality" has been ...
Roman domination is a historically inspired variety of general domination such that every vertex is labeled with labels from {0, 1, 2}. Roman domination number is the smallest of the sums of labels fulfilling condition that every vertex, labeled 0, has a neighbor, labeled 2. Using algebraic approach we give O(C) time algorithm for computing Roman domination number of special classes of polygrap...
Rainbow vertex-connection number is the minimum k-coloring on vertex graph G and denoted by rvc(G). Besides, rainbow-vertex connection can be applied to some special graphs, such as prism path graph. Graph operation a method used create new combining two graphs. Therefore, this research uses corona product form at resulting from of (Pm,2 P3) (P3 Pm,2). The results study obtain that theorem rain...
1)فرض کنید g=(v,e) یک گراف ساده باشد.همسا یگی بسته رأس v?v را بصورت زیر نشان می دهیم : n[v]={u:uv?e}?{v} 2)تابعf:v?{-1,1} را تابع غالب علامت دار(signed dominating function یا به اختصار s.d.f) نامیم هرگاه به ازای هر v?v داشته باشیم f[v]=?_(u?n[v])?f(u) ?1:. 3)وزنfکه یکsdfمی باشد به صورت مقابل تعریف می شود: f(g)=?_(v?v)?f(v) . 4)می نیمم وزن تابع غالب علامتدار تعریف شده روی گراف g را با نماد?_s ...
An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this paper we show that rc(G) ≤ 3 if |E(G)| ≥ ( n−2 2 ) + 2, and rc(G) ≤ 4 if |E(G)| ≥ ( n−3 2 ) + 3. These bounds...
We prove that for graphs of order n, minimum degree δ ≥ 2 and girth g ≥ 5 the domination number γ satisfies γ ≤ ( 1 3 + 2 3g ) n. As a corollary this implies that for cubic graphs of order n and girth g ≥ 5 the domination number γ satisfies γ ≤ ( 44 135 + 82 135g ) n which improves recent results due to Kostochka and Stodolsky (An upper bound on the domination number of n-vertex connected cubic...
In this paper, we introduce the concept of k-power domination which is a common generalization of domination and power domination. We extend several known results for power domination to k-power domination. Concerning the complexity of the k-power domination problem, we first show that deciding whether a graph admits a k-power dominating set of size at most t is NP-complete for chordal graphs a...
Let $R$ be a commutative ring and $M$ be an $R$-module with $T(M)$ as subset, the set of torsion elements. The total graph of the module denoted by $T(Gamma(M))$, is the (undirected) graph with all elements of $M$ as vertices, and for distinct elements $n,m in M$, the vertices $n$ and $m$ are adjacent if and only if $n+m in T(M)$. In this paper we study the domination number of $T(Gamma(M))$ a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید