Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees

DOI10.7151/dmgt.1935zbMath1366.05095OpenAlexW2549340483MaRDI QIDQ2364083

Kecai Deng, Xiao-Ling Zhang

Publication date: 17 July 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1935

zbMATH Keywords

treediameter\(L(2, 1, 1)\)-labeling

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Distance three labelings of trees
• \(L(3,2,1)\)-labeling of graphs
• The \(L(h,1,1)\)-labelling problem for trees
• A distance-labelling problem for hypercubes
• Labeling trees with a condition at distance two.
• Distance three labelings for direct products of three complete graphs
• The \(L(2,1)\)-labelling of trees
• A survey on labeling graphs with a condition at distance two
• L(2,1,1)-Labeling Is NP-Complete for Trees
• A Linear Time Algorithm for L(2,1)-Labeling of Trees
• Labelling Graphs with a Condition at Distance 2
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees