Radio k-chromatic Number of Full m-ary Trees
Sign Up to like & getrecommendations! Published in 2021 at "Theory of Computing Systems"
DOI: 10.1007/s00224-021-10056-7
Abstract: For a simple connected graph G = (V (G),E(G)) and a positive integer k, a radio k-labelling of G is a mapping $f \colon V(G)\rightarrow \{0,1,2,\ldots \}$ such that $|f(u)-f(v)|\geqslant k+1-d(u,v)$ for each pair of… read more here.
Keywords: radio chromatic; ary trees; chromatic number; number full ... See more keywords