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

DOI10.1016/J.DISC.2013.06.011zbMATH Open1281.05119OpenAlexW2199296424MaRDI QIDQ393463FDOQ393463

Authors: Ziming Duan, Cui-Qi Wang, Lianying Miao, Zhengke 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

Recommendations

• Labeling trees with a condition at distance two.
• scientific article; zbMATH DE number 7295442
• \(L(3,2,1)\)-labeling of graphs
• \(L(3,2,1)\)-labelling of graphs
• Linear and cyclic distance-three labellings of trees

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

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

Cited In (2)

• A note on \(L (2, 1)\)-labelling of trees
• Pair \(L(2, 1)\)-labelings of infinite graphs

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

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