scientific article; zbMATH DE number 7688018

DOI10.3770/j.issn:2095-2651.2023.02.003zbMath1524.05282MaRDI QIDQ6039745

Xiao-Ling Zhang

Publication date: 23 May 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

channel assignmentcaterpillarspan\(L(2, 1, 1)\)-labeling

Mathematics Subject Classification ID

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

Cites Work

• \(L(3,2,1)\)-labeling of triangular and toroidal grids
• 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
• \(L(h,1,1)\)-labeling of outerplanar graphs
• Labeling trees with a condition at distance two.
• Distance three labelings for direct products of three complete graphs
• Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
• The \(L(2,1)\)-labelling of trees
• A survey on labeling graphs with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: