Distance three labelings for direct products of three complete graphs

DOI10.11650/TJM.17.2013.1909MaRDI QIDQ1949031zbMATH OpenOpenAlexFDO

Authors Byeong Moon Kim, Byung Chul Song, Woonjae Hwang

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 productsradio numbercomplete graphsdistance three labeling

Mathematics Subject Classification ID

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

Recommendations

• Distance two labelings of Cartesian products of complete graphs.
• Distance two labelling and direct products of graphs
• New \(L(j,k)\)-labelings for direct products of complete graphs
• Radio number for the product of a path and a complete graph
• Labeling products of complete graphs with a condition at distance two

Cited in

(6)

• scientific article; zbMATH DE number 7688018 (Why is no real title available?)
• Radio number for the product of a path and a complete graph
• L(3,2,1)-labeling of triangular and toroidal grids
• Linear and cyclic distance-three labellings of trees
• Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
• \(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949031)