@article {
author = {Choopani, Fatemeh and Jafarzadeh, Abbas and Mojdeh, Doost Ali},
title = {Dominated Coloring of Certain Graphs},
journal = {Global Analysis and Discrete Mathematics},
volume = {7},
number = {1},
pages = {89-99},
year = {2022},
publisher = {Damghan University Press},
issn = {2476-5341},
eissn = {2476-7700},
doi = {10.22128/gadm.2022.624.1081},
abstract = {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.},
keywords = {Dominated coloring,dominated chromatic covering,dominated chromatic covering number},
url = {https://gadm.du.ac.ir/article_287.html},
eprint = {https://gadm.du.ac.ir/article_287_6ee28d4d597d24bb863fc400911de72a.pdf}
}