Zobrazeno 1 - 1
of 1
pro vyhledávání: '"C. Ike Tri Widyastuti"'
Publikováno v:
Indonesian Journal of Combinatorics, Vol 2, Iss 1, Pp 50-56 (2018)
Let G = (V,E) be a connected graph. Let c be a proper coloring using k colors, namely 1, 2,·s, k. Let P={S1, S2,..., Sk} be a partition of V(G) induced by c and let Si be the color class that receives the color i. The color code, cP(v)=(d(v,S1), d(v
Externí odkaz:
https://doaj.org/article/cb5bc000e5e5432e83e5b782576e783c
