Search
Now showing items 1-2 of 2
On r-dynamic coloring of some graph operations
(2018-03-07)
Let G be a simple, connected and undirected graph. Given r; k as any natural numbers. By an
r-dynamic k-coloring of graph G, we mean a proper k-coloring c(v) of G such that jc(N(v))j
minfr; d(v)g for each vertex v in ...
Analisa Pewarnaan Total r-Dinamis pada Graf Lintasan dan Graf Hasil Operasi
(CGANT Journal of Mathematics and Applications, 2021-06-22)
Graph coloring began to be developed into coloring dynamic. One of the developments of
dynamic coloring is r-dynamic total coloring. Suppose G = (V (G), E(G)) is a non-trivial
connected graph. Total coloring is defined ...