2019/11/29 by Saeid Alikhani, Alikhani, Saeid, Mohammad R. Piri +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1912.00016
Let G be a simple graph. The dominated coloring of a graph G is a proper coloring of G such that each color class is dominated by at least one vertex. The minimum number of colors needed for a dominated coloring of G is called the dominated chromatic number of G, denoted by χdom(G). In this paper, we examine the effects on χdom(G) when G is modified by operations on vertex and edge of G.