- Tytuł:
- Global Dominator Coloring of Graphs
- Autorzy:
-
Hamid, Ismail Sahul
Rajeswari, Malairaj - Powiązania:
- https://bibliotekanauki.pl/articles/31343452.pdf
- Data publikacji:
- 2019-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
global domination
coloring
global dominator coloring
dominator coloring - Opis:
- Let S ⊆ V. A vertex v ∈ V is a dominator of S if v dominates every vertex in S and v is said to be an anti-dominator of S if v dominates none of the vertices of S. Let C = (V1, V2, . . ., Vk) be a coloring of G and let v ∈ V (G). A color class Vi is called a dom-color class or an anti domcolor class of the vertex v according as v is a dominator of Vi or an antidominator of Vi. The coloring C is called a global dominator coloring of G if every vertex of G has a dom-color class and an anti dom-color class in C. The minimum number of colors required for a global dominator coloring of G is called the global dominator chromatic number and is denoted by χgd(G). This paper initiates a study on this notion of global dominator coloring.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2019, 39, 2; 325-339
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł