Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Total Global Dominator Coloring of Trees and Unicyclic Graphs
View through CrossRef
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 not dominate another color class. The minimum number of colors required in such a coloring of is called the total global dominator chromatic number, denoted by . In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored.
College of Science for Women, University of Baghdad
Title: Total Global Dominator Coloring of Trees and Unicyclic Graphs
Description:
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 not dominate another color class.
The minimum number of colors required in such a coloring of is called the total global dominator chromatic number, denoted by .
In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored.
Related Results
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 ...
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...
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...
Extremal Gourava indices of unicyclic graphs
Extremal Gourava indices of unicyclic graphs
Abstract
Topological indices are useful molecular descriptors to measure Quantitative Structure-Activity Relationship (QSAR), Quantitative Structure-Property Relationship (...
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...
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
Let G be a connected and undirected graph. Vertex coloring in a graph G is a mapping from the set of vertices in G to the set of colors such that every two adjacent vertices have d...