نتایج جستجو برای: 2 rainbow domination
تعداد نتایج: 2539287 فیلتر نتایج به سال:
Theorem 3. (Hansberg, Volkmann [4], 2007) Let G be a cactus graph. Then γ2(G) = γ(G) if and only if G is a C4-cactus. Let H be the family of graphs such that G ∈ H if and only if either G arises from a cartesian product Kp ×Kp of two complete graphs of order p for an integer p ≥ 3 by inflating every vertex but the ones on a transversal to a clique of arbitrary order, or G is a claw-free graph w...
A rainbow colouring of a connected graph G is a colouring of the edges of G such that every pair of vertices in G is connected by at least one path in which no two edges are coloured the same. The minimum number of colours required to rainbow colour G is called its rainbow connection number. Chakraborty, Fischer, Matsliah and Yuster have shown that it is NP-hard to compute the rainbow connectio...
The Rainbow k-Coloring problem asks whether the edges of a given graph can be colored in k colors so that every pair of vertices is connected by a rainbow path, i.e., a path with all edges of different colors. Our main result states that for any k ≥ 2, there is no algorithm for Rainbow k-Coloring running in time 2 3/2), unless ETH fails. Motivated by this negative result we consider two paramet...
A rainbow subgraph of an edge-colored graph is a subgraph whose edges have distinct colors. The color degree of a vertex v is the number of different colors on edges incident to v. Wang and Li conjectured that for k > 4, every edge-colored graph with minimum color degree at least k contains a rainbow matching of size at least ⌈k/2⌉. We prove the slightly weaker statement that a rainbow matching...
A set D of vertices in a graph G is 2-dominating if every vertex not in D has at least two neighbors in D and locating-dominating if for every two vertices u, v not in D, the sets N(u) ∩ D and N(v) ∩ D are non-empty and different. The minimum cardinality of a 2-dominating set (locatingdominating set) is denoted by γ2(G) (γL(G)). It is known that every tree T with n ≥ 2 vertices, leaves, s suppo...
In a graph, a vertex is said to dominate itself and all its neighbors. A double dominating set of a graph G is a subset of vertices that dominates every vertex of G at least twice. The double domination number γ×2(G) is the minimum cardinality of a double dominating set of G. A graph G without isolated vertices is called edge removal critical with respect to double domination, or just γ×2-criti...
For a graph G = (V,E), a subset D ⊆ V (G) is a total dominating set if every vertex of G has a neighbor in D. The total domination number of G is the minimum cardinality of a total dominating set of G. A subset D ⊆ V (G) is a 2-dominating set of G if every vertex of V (G) \ D has at least two neighbors in D, while it is a 2-outer-independent dominating set of G if additionally the set V (G) \ D...
In a properly vertex-colored graphG, a path P is a rainbow path if no two vertices of P have the same color, except possibly the two end-vertices of P . If every two vertices of G are connected by a rainbow path, then G is vertex rainbow-connected. A proper vertex coloring of a connected graph G that results in a vertex rainbow-connected graph is a vertex rainbow coloring ofG. The minimum numbe...
For a graph G = (V,E), a set D ⊆ V is called a semitotal dominating set of G if D is a dominating set of G, and every vertex in D is within distance 2 of another vertex of D. The Minimum Semitotal Domination problem is to find a semitotal dominating set of minimum cardinality. Given a graph G and a positive integer k, the Semitotal Domination Decision problem is to decide whether G has a semito...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید