\(l(3,2,1)\)-labeling for the product of a complete graph and a cycle

DOI10.11650/tjm.19.2015.4632zbMath1357.05134OpenAlexW1596060973MaRDI QIDQ514887

Woonjae Hwang, Byeong Moon Kim, Byung Chul Song

Publication date: 9 March 2017

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

Full work available at URL: https://doi.org/10.11650/tjm.19.2015.4632

zbMATH Keywords

2Cartesian productsgraph labeling1)\)-labeling\(L(3distance three labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Unnamed Item ⋮ L(3,2,1)-Labeling problems on trapezoid graphs

Cites Work

• Unnamed Item
• A distance-labelling problem for hypercubes
• Radio number for trees
• A survey on labeling graphs with a condition at distance two
• Multilevel Distance Labelings for Paths and Cycles

This page was built for publication: \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle