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

Equitable Dominator Coloring of Helm-Related Graphs

View through CrossRef
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 cardinalities of any two color classes differ by at most 1. The minimum number of colors used in the equitable dominator coloring of [Formula: see text] is called its equitable dominator chromatic number, denoted by [Formula: see text]. This paper discusses the equitable dominator coloring of various helm-related graphs by obtaining their equitable dominator chromatic numbers.
Title: Equitable Dominator Coloring of Helm-Related Graphs
Description:
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 cardinalities of any two color classes differ by at most 1.
The minimum number of colors used in the equitable dominator coloring of [Formula: see text] is called its equitable dominator chromatic number, denoted by [Formula: see text].
This paper discusses the equitable dominator coloring of various helm-related graphs by obtaining their equitable dominator chromatic numbers.

Related Results

Efficient Open Dominator Coloring in Cycles and Paths
Efficient Open Dominator Coloring in Cycles and Paths
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 vertice...
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...
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...
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...
Graphs with at most two moplexes
Graphs with at most two moplexes
AbstractA moplex is a natural graph structure that arises when lifting Dirac's classical theorem from chordal graphs to general graphs. The notion is known to be closely related to...
DESAIN BAGASI HELM SEPEDA MOTOR SEBAGAI ALTERNATIF PENYIMPANAN HELM
DESAIN BAGASI HELM SEPEDA MOTOR SEBAGAI ALTERNATIF PENYIMPANAN HELM
Bagasi Helm Alternatif pada sepeda motor online menjadi sangat penting bagi ojek online. Sepeda motor tahun keluaran terbaru pada dasarnya sudah menyediakan tempat penyimpanan helm...
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...
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...

Back to Top