Distance three labelings for direct products of three complete graphs

DOI10.11650/tjm.17.2013.1909zbMath1263.05088OpenAlexW2580502465MaRDI QIDQ1949031

Woonjae Hwang, Byeong Moon Kim, Byung Chul Song

Publication date: 25 April 2013

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: http://journal.taiwanmathsoc.org.tw/index.php/TJM/article/view/1909

zbMATH Keywords

direct productscomplete graphsradio numberdistance three labeling

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (6)

Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees ⋮ \(L(3,2,1)\)-labeling of triangular and toroidal grids ⋮ Unnamed Item ⋮ Linear and cyclic distance-three labellings of trees ⋮ Radio number for the product of a path and a complete graph ⋮ $L(3,2,1)$-labeling for Cylindrical grid: the cartesian product of a path and a cycle

This page was built for publication: Distance three labelings for direct products of three complete graphs