Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Dominating Cocoloring of Graphs
View through CrossRef
A -cocolouring of a graph is a partition of the vertex set into subsets such that each set induces either a clique or an independent set in . The cochromatic number of a graph is the least such that has a -cocolouring of . A set is a dominating set of if for each , there exists a vertex such that is adjacent to . The minimum cardinality of a dominating set in is called the domination number and is denoted by . Combining these two concepts we have introduces two new types of cocoloring viz, dominating cocoloring and -cocoloring. A dominating cocoloring of is a cocoloring of such that atleast one of the sets in the partition is a dominating set. Hence dominating cocoloring is a conditional cocoloring. The dominating co-chromatic number is the smallest cardinality of a dominating cocoloring of .(ie) has a dominating cocoloring with -colors .
Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP
Title: Dominating Cocoloring of Graphs
Description:
A -cocolouring of a graph is a partition of the vertex set into subsets such that each set induces either a clique or an independent set in .
The cochromatic number of a graph is the least such that has a -cocolouring of .
A set is a dominating set of if for each , there exists a vertex such that is adjacent to .
The minimum cardinality of a dominating set in is called the domination number and is denoted by .
Combining these two concepts we have introduces two new types of cocoloring viz, dominating cocoloring and -cocoloring.
A dominating cocoloring of is a cocoloring of such that atleast one of the sets in the partition is a dominating set.
Hence dominating cocoloring is a conditional cocoloring.
The dominating co-chromatic number is the smallest cardinality of a dominating cocoloring of .
(ie) has a dominating cocoloring with -colors .
Related Results
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Nonsplit Neighbourhood Tree Domination Number In Connected Graphs
Nonsplit Neighbourhood Tree Domination Number In Connected Graphs
: Let G = (V, E) be a connected graph. A subset D of V is called a dominating set of G if N[D] = V. The minimum cardinality of a dominating set of G is called the domination number...
New results on connected dominating structures in graphs
New results on connected dominating structures in graphs
Abstract
A set of vertices in a graph is a dominating set if every vertex not in the set is adjacent to at least one vertex in the set. A dominating structure is a s...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Domination of polynomial with application
Domination of polynomial with application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Hardness and algorithmic results for Roman \{3\}-domination
Hardness and algorithmic results for Roman \{3\}-domination
A Roman $\{3\}$-dominating function on a graph $G = (V, E)$ is a function $f: V \rightarrow \{0, 1, 2, 3\}$ such that for each vertex $u \in V$, if $f(u) = 0$ then $\sum\limits_{v ...