Edge span of L(d,1)-labeling on some graphs

MaRDI QIDQ5486908zbMATH OpenFDO

Authors Guizhen Feng, Zengmin Song

Publication date 15 September 2006

zbMATH Keywords

channel assignmenttriangular latticesquare latticechoral graphs

Mathematics Subject Classification ID

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

Recommendations

• On \(L(d,1)\)-labelings of graphs
• \(L(2,1)\)-labeling of graphs: known results and open problems
• scientific article; zbMATH DE number 2145257
• \(L(1, 2)\)-labeling numbers on square of cycles
• The \(L(d_1,d_2)\)-labeling problem on graphs

Cited in

(9)

• Utility and expandability of channel assignments.
• Edge span of distance labeling of digraphs
• Labelings of Graphs with Fixed and Variable Edge-Weights
• \(L(s, t)\) edge spans of trees and product of two paths
• \(\lambda\)-edge span of some almost regular graphs
• \(L (d,1)\)-labelings of the Möbius ladders
• Distance two labelings on regular bipartite graphs.
• The edge span of distance two labellings of graphs
• \(L(p,q)\)-labeling and integer tension of a graph embedded on torus

This page was built for publication: Edge span of \(L(d,1)\)-labeling on some graphs

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