\(L(p,2,1)\)-labeling of the infinite regular trees

DOI10.1016/j.disc.2013.06.011zbMath1281.05119OpenAlexW2199296424MaRDI QIDQ393463

Cuiqi Wang, Ziming Duan, Zheng-Ke Miao, Lian-Ying Miao

Publication date: 23 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.06.011

zbMATH Keywords

\(L(p, 2, 1)\)-labelingdistance constrained labelinginfinite regular tree

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(T\)-colorings of graphs: recent results and open problems
• Labeling trees with a condition at distance two.
• On \(L(d,1)\)-labelings of graphs
• A survey on labeling graphs with a condition at distance two
• L(h,1,1)-Labeling of Outerplanar Graphs
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• The $L(2,1)$-Labeling Problem on Graphs
• Labeling trees with a condition at distance two

This page was built for publication: \(L(p,2,1)\)-labeling of the infinite regular trees