\(L(3,2,1)\)-labeling of graphs

DOI10.11650/TWJM/1500406480zbMath1247.05203OpenAlexW1781007597MaRDI QIDQ449571

J. Herrera, D. Rodríguez-Gómez

Publication date: 31 August 2012

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/1444

zbMATH Keywords

treecyclepowerpathCartesian product\(L(3, 2, 1)\)-labeling

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (16)

Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees ⋮ \(L(3,2,1)\)-labeling of triangular and toroidal grids ⋮ \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs ⋮ Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids ⋮ \(L(3, 2, 1)\)-labeling of banana trees ⋮ L(2,1,1)-labeling of interval graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On a distance-constrained graph labeling to model cooperation ⋮ Frequency assignment problem in networks with limited spectrum ⋮ Distance two surjective labelling of paths and interval graphs ⋮ Distance-constrained labeling of complete trees ⋮ L(3,2,1)-Labeling problems on trapezoid graphs ⋮ $L(3,2,1)$-labeling for Cylindrical grid: the cartesian product of a path and a cycle

This page was built for publication: \(L(3,2,1)\)-labeling of graphs