scientific article; zbMATH DE number 7688018

DOI10.3770/J.ISSN:2095-2651.2023.02.003MaRDI QIDQ6039745zbMATH OpenFDO

Authors Xiaoling Zhang

Publication date 23 May 2023

Full work available at URL https://doi.org/10.3770/J.ISSN:2095-2651.2023.02.003

zbMATH Keywords

\(L(2, 1, 1)\)-labelingcaterpillarchannel assignmentspan

Mathematics Subject Classification ID

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

Recommendations

• The $L(2,1)$-Labeling Problem on Graphs
• Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
• scientific article; zbMATH DE number 2197903
• scientific article; zbMATH DE number 2091962
• Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
• scientific article; zbMATH DE number 2073985
• On strict-double-bound numbers of caterpillars
• Totally irregular total labeling of some caterpillar graphs
• Optimal L(3, 2, 1)-labeling of triangular lattice
• The \(L(2,1)\)-labeling on Cartesian sum of graphs

Cites work

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

Cited in

(2)

• A characterization of interior 2-caterpillars
• Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube

This page was built for publication:

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