Abstract
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$.
Citation
Byeong Moon Kim. Byung Chul Song. Woonjae Hwang. "DISTANCE THREE LABELINGS FOR DIRECT PRODUCTS OF THREE COMPLETE GRAPHS." Taiwanese J. Math. 17 (1) 207 - 219, 2013. https://doi.org/10.11650/tjm.17.2013.1909
Information
