Add to ORKGIn a simple graph G, a subset D of V (G) is called a chromatic weak dominating set if D is a weak dominating set and χ() = χ(G). Similar to domatic partition, chromatic weak domatic partition can be defined. The maximum cardinality of a chromatic weak domatic partition is called the chromatic weak domatic number of G. Bounds for this number are obtained and new results are derived involving chromatic weak domatic number and chromatic weak domination number.Publisher's Versio
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a verte...
A set D of vertices in a graph G = (V,E) is a weakly connected dominating set of G if D is dominatin...
Let G=(V, E) be a graph and u, v is an element of V. Then, u strongly dominates u and v weakly domin...
The chromatic number χ(G) of a graph G is the minimum number of colours required to colour the verti...
A set of vertices S in a graph G = (V, E) is a dominating set if every vertex not in S is adjacent t...
Let G = (V, E) be a graph with chromatic number k. A dominating set D of G is called a chromatic tra...
Color class domination partition was suggested by E. Sampathkumar and it was studied in [1]. A prope...
A domatic partition P of a graph G=(V,E) is a partition of V into classes that are pairwise disjoint...
AbstractLet χ(G) be the chromatic number of a graph G=(V,E), and k⩾1 be an integer. The general chro...
AbstractA subset, D, of the vertex set of a graph G is called a dominating set of G if each vertex o...
summary:Let $k$ be a positive integer, and let $G$ be a simple graph with vertex set $V(G)$. A {\it ...
A domatic partition of a graph GH = (V, E) is a partition of V into disjoint sets V1,V2, …Vk such th...
Let G = (V(G),E(G)) be a graph. If uv ? E(G), then u and v dominate each other. Further, u strongly ...
Let be a simple, finite and undirected graph and without isolated vertex. A subset D of V is s...
Abstract Strong dominating amp61539- color number of a graph G is defined as the maximum number of c...
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a verte...
A set D of vertices in a graph G = (V,E) is a weakly connected dominating set of G if D is dominatin...
Let G=(V, E) be a graph and u, v is an element of V. Then, u strongly dominates u and v weakly domin...
The chromatic number χ(G) of a graph G is the minimum number of colours required to colour the verti...
A set of vertices S in a graph G = (V, E) is a dominating set if every vertex not in S is adjacent t...
Let G = (V, E) be a graph with chromatic number k. A dominating set D of G is called a chromatic tra...
Color class domination partition was suggested by E. Sampathkumar and it was studied in [1]. A prope...
A domatic partition P of a graph G=(V,E) is a partition of V into classes that are pairwise disjoint...
AbstractLet χ(G) be the chromatic number of a graph G=(V,E), and k⩾1 be an integer. The general chro...
AbstractA subset, D, of the vertex set of a graph G is called a dominating set of G if each vertex o...
summary:Let $k$ be a positive integer, and let $G$ be a simple graph with vertex set $V(G)$. A {\it ...
A domatic partition of a graph GH = (V, E) is a partition of V into disjoint sets V1,V2, …Vk such th...
Let G = (V(G),E(G)) be a graph. If uv ? E(G), then u and v dominate each other. Further, u strongly ...
Let be a simple, finite and undirected graph and without isolated vertex. A subset D of V is s...
Abstract Strong dominating amp61539- color number of a graph G is defined as the maximum number of c...
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a verte...
A set D of vertices in a graph G = (V,E) is a weakly connected dominating set of G if D is dominatin...
Let G=(V, E) be a graph and u, v is an element of V. Then, u strongly dominates u and v weakly domin...