نتایج جستجو برای: k rainbow domination number
تعداد نتایج: 1499647 فیلتر نتایج به سال:
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a graph as the smallest number of edges that have to be added to a graph to reduce the domination number by k. We present an O(kn) dynamic programming algorithm for computing the maximum number of vertices that can be do...
A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such ...
A sequence of vertices in a graph G is called a legal dominating sequence if every vertex in the sequence dominates at least one vertex not dominated by those vertices that precede it, and at the end all vertices of G are dominated. While the length of a shortest such sequence is the domination number of G, in this paper we investigate legal dominating sequences of maximum length, which we call...
Let [Formula: see text] be a graph. A set [Formula: see text] is a distance k-dominating set of G if for every vertex [Formula: see text], [Formula: see text] for some vertex [Formula: see text], where k is a positive integer. The distance k-domination number [Formula: see text] of G is the minimum cardinality among all distance k-dominating sets of G. The first Zagreb index of G is defined as ...
In this paper, we evaluate the connected domination number of (Zn), in some case of n. We find out that the connected domination number of (Z p e1 1 ×p e2 2 ×···×p ek k ) is equal to k. Finally, we characterize the graphs in which γ ( (Zn)) = γc( (Zn)). AMS subject classification: 05C25, 05C69.
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...
The recently introduced concept of k-power domination generalizes domination and power domination, the latter concept being used for monitoring an electric power system. The k-power domination problem is to determine a minimum size vertex subset S of a graph G such that after setting X = N [S], and iteratively adding to X vertices x that have a neighbour v in X such that at most k neighbours of...
Given an edge-coloured graph, we say that a subgraph is rainbow if all of its edges have different colours. Let $\operatorname{ex}(n,H,$rainbow-$F)$ denote the maximal number copies $H$ properly graph on $n$ vertices can contain it has no isomorphic to $F$. We determine order magnitude $\operatorname{ex}(n,C_s,$rainbow-$C_t)$ for $s,t$ with $s\not =3$. In particular, answer question Gerbner, M\...
Given a graph G and a subgraph H of G, let rb(G,H) be the minimum number r for which any edge-coloring of G with r colors has a rainbow subgraph H. The number rb(G,H) is called the rainbow number of H with respect to G. Denote mK2 a matching of size m and Bn,k a k-regular bipartite graph with bipartition (X,Y ) such that |X| = |Y | = n and k ≤ n. In this paper we give an upper and lower bound f...
The inflated graph GI of a graph G with n(G) vertices is obtained from G by replacing every vertex of degree d of G by a clique, which is isomorph to the complete graph Kd, and each edge (xi, xj) of G is replaced by an edge (u, v) in such a way that u ∈ Xi, v ∈ Xj , and two different edges of G are replaced by non-adjacent edges of GI . For integer k ≥ 1, the k-tuple total domination number γ ×...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید