DISTANCE THREE LABELINGS FOR DIRECT PRODUCTS OF THREE COMPLETE GRAPHS
Byeong Moon Kim, Byung Chul Song, Woonjae Hwang · Taiwanese Journal of Mathematics · 2013
In this paper, we determine the distance 3 labeling number for the direct product $G = K_n \times K_m \times K_2$ ($n \geq m \geq 3$) of 3 complete graphs under various conditions on $j$ and $k$. As a quence, we have the radio number $\textrm{rn}(G) = 2mn-1$.