Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Efficient Open Dominator Coloring in Cycles and Paths

View through CrossRef
In 2006, Gera introduced and studied the dominator chromatic number. [4]. A dominator coloring of a graph G is a proper coloring in which each vertex of G dominates all the vertices of at least one color class. The dominator chromatic number ?d(G) is the minimum number of colors required for a dominator coloring of G. In this paper we introduced, a proper coloring of G is called open dominator coloring, if N(v) contains at least one color class for each v ? V(G). An open dominator coloring of G is called efficient open dominator coloring, if N(v) contains exactly one color class for each v ? V(G). An open dominator coloring of G is called efficient k-open dominator coloring, if N(v) contains exactly k color classes for each v ? V(G) Also, we characterized some classes of graphs which admits efficient open dominator coloring of complete graphs, complete bipartite graphs, stars, wheels, paths, cycles, gear graphs.
Title: Efficient Open Dominator Coloring in Cycles and Paths
Description:
In 2006, Gera introduced and studied the dominator chromatic number.
[4].
A dominator coloring of a graph G is a proper coloring in which each vertex of G dominates all the vertices of at least one color class.
The dominator chromatic number ?d(G) is the minimum number of colors required for a dominator coloring of G.
In this paper we introduced, a proper coloring of G is called open dominator coloring, if N(v) contains at least one color class for each v ? V(G).
An open dominator coloring of G is called efficient open dominator coloring, if N(v) contains exactly one color class for each v ? V(G).
An open dominator coloring of G is called efficient k-open dominator coloring, if N(v) contains exactly k color classes for each v ? V(G) Also, we characterized some classes of graphs which admits efficient open dominator coloring of complete graphs, complete bipartite graphs, stars, wheels, paths, cycles, gear graphs.

Related Results

BILANGAN DOMINATOR CHROMATIC PADA GRAF CYCLE, ANTIPRISMA DAN PRISMA
BILANGAN DOMINATOR CHROMATIC PADA GRAF CYCLE, ANTIPRISMA DAN PRISMA
Diberikan graf  dominator coloring merupakan pewarnaaan simpul (proper coloring) sehingga simpul-simpul graf    mendominasi setiap simpul pada beberapa kelas warna. Jumlah kelas w...
Equitable Dominator Coloring of Helm-Related Graphs
Equitable Dominator Coloring of Helm-Related Graphs
An equitable dominator coloring of a graph [Formula: see text] is a proper vertex coloring of [Formula: see text] such that every vertex dominates at least one color class and the ...
DOMINATOR CHROMATIC NUMBER OF LEXICOGRAPHIC PRODUCT OF PATH WITH CERTAIN GRAPHS
DOMINATOR CHROMATIC NUMBER OF LEXICOGRAPHIC PRODUCT OF PATH WITH CERTAIN GRAPHS
A dominator coloring of a graph is a proper coloring in which every vertex is adjacent to at least one vertex from each color class. The minimum number of colors required to achiev...
Some New Results on Equitable Dominator Coloring of Graphs
Some New Results on Equitable Dominator Coloring of Graphs
 An equitable dominator coloring is a proper vertex coloring of the graph $G$ such that each vertex dominates at least one color class and the cardinalities of the color classes di...
Florence, Pope Clement VII and Emperor Charles V. A contextual study of the motet ‘Dominator caelorum’ by Jean Conseil / Costanzo Festa (?)
Florence, Pope Clement VII and Emperor Charles V. A contextual study of the motet ‘Dominator caelorum’ by Jean Conseil / Costanzo Festa (?)
Costanzo Festa (ca. 1490–1545) and Jean Conseil (ca. 1498–1534) spent most of their life in the papal chapel and composed motets based on the same texts: 'Deus venerunt gentes’, pr...
Total Global Dominator Coloring of Trees and Unicyclic Graphs
Total Global Dominator Coloring of Trees and Unicyclic Graphs
          A total global dominator coloring of a graph  is a proper vertex coloring of  with respect to which every vertex  in  dominates a color class, not containing  and does no...
Fuzzy Dominator Coloring
Fuzzy Dominator Coloring
Finding the right color for a graph while taking into account that each vertex in the graph dominates a whole color class is known as the dominator coloring problem. Fuzzy dominato...
Graph Coloring
Graph Coloring
In this chapter a particular type of graph labeling, called graph coloring, is introduced and discussed. In the first part, the simple type of coloring, vertex coloring, is focused...

Back to Top