On r-dynamic chromatic number of some brick product graphs C(2n,1,p)
An [Formula: see text]-dynamic coloring of a graph [Formula: see text] is a proper coloring [Formula: see text] of the vertices such that [Formula: see text] for each vertex [Formula: see text]. The [Formula: see text]-dynamic chromatic number of a graph [Formula: see text] is the minimum [Formula: see text] such that [Formula: see text] has an [Formula: see text]-dynamic coloring with [Formula: see text] colors. In this paper, we obtain the [Formula: see text]-dynamic chromatic number of brick product graphs.
2003 ◽
Vol Vol. 6 no. 1
◽
Keyword(s):
Keyword(s):
2021 ◽
Vol 27
(2)
◽
pp. 191-200
Keyword(s):
Keyword(s):
2007 ◽
Vol 44
(1)
◽
pp. 49-55
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):