| Autor: |
Choopani, Fatemeh, Jafarzadeh, Abbas, Mojdeh, Doost Ali |
| Předmět: |
|
| Zdroj: |
Global Analysis & Discrete Mathematics; 2022, Vol. 7 Issue 1, p89-99, 11p |
| Abstrakt: |
A proper coloring of a graph G is called a dominated coloring whenever each color class is dominated by at least one vertex. The minimum number of colors among all dominated colorings of G is called its dominated chromatic number, denoted by χdom(G). We define a parameter related to dominated coloring, namely dominated chromatic covering. For a minimum dominated coloring of G, a set of vertices S is called a dominated chromatic covering if each color class is dominated by a vertex of S. The minimum cardinality of a dominated chromatic covering of G is called its dominated chromatic covering number, denoted by θχdom(G) . It is clear that θχdom(G) ≤ χdom(G). In this paper, we obtain the dominated chromatic number and θχdom(G) when G is middle and total graph of paths and cycles. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
