نتایج جستجو برای: 2 rainbow domination number
تعداد نتایج: 3412189 فیلتر نتایج به سال:
Rainbow connection number rc(G) of a connected graph G is the minimum number of colours needed to colour the edges of G, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this paper we show that for every connected graph G, with minimum degree at least 2, the rainbow connection number is upper bounded by γc(G) + 2, where γc(G) is th...
Abstract By suitably adjusting the tropical algebra technique we compute rainbow independent domination numbers of several infinite families graphs including Cartesian products $$C_n \Box P_m$$ C n ? P m </mm...
Domination and 2-domination numbers are defined only for graphs with non-isolated vertices. In a Graph G = (V, E) each vertex is said to dominate every in its closed neighborhood. graph G, subset S of V(G) called 2-dominating set if v ∈ V, V-S has atleast two neighbors S. The smallest cardinality known as the number γ2(G). this paper, we find some special also graphs.
In this paper we focus on 2- domination number of a fuzzy graph G by using effective edge and is denoted γ2(G) obtain some results concept, the relationship between other concepts are obtained.
Let f be a function that assigns to each vertex a subset of colors chosen from a set C = {1, 2, . . . , k} of k colors. If u∈N(v) f (u) = C for each vertex v ∈ V with f (v) = ∅, then f is called a k-rainbow dominating function (kRDF) of G where N(v) = {u ∈ V | uv ∈ E}. The weight of f , denoted by w(f ), is defined as w(f ) = v∈V |f (v)|. Given a graph G, the minimum weight among all weight...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید