Neighbor product distinguishing total colorings
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-015-9952-0
Abstract: A total-[k]-coloring of a graph G is a mapping $$\phi : V (G) \cup E(G)\rightarrow \{1, 2, \ldots , k\}$$ϕ:V(G)∪E(G)→{1,2,…,k} such that any two adjacent elements in $$V (G) \cup E(G)$$V(G)∪E(G) receive different colors. Let… read more here.
Keywords: product distinguishing; neighbor product; distinguishing total; prime prime ... See more keywords