نتایج جستجو برای: total dominator chromatic number
تعداد نتایج: 1837510 فیلتر نتایج به سال:
given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...
Dominator chromatic number of middle and total graphs of various graph families is found in this paper. Also these parameters are compared with dominator chromatic number of their respective graph families.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید