On L(1,2)-edge-labelings of some special classes of graphs

DOI10.3770/J.ISSN:2095-2651.2014.04.003zbMATH Open1313.05317MaRDI QIDQ5498079FDOQ5498079

Authors: Dan He, Wensong Lin 

Publication date: 11 February 2015

Recommendations

• \(L(1, 2)\)-edge-labelings for lattices
• On circular-\(L\)(2,1)-edge-labeling of graphs
• The \(L(j,k)\)-edge-labeling problem on graphs.
• scientific article; zbMATH DE number 5036064
• Real edge spans of distance two labelings of graphs

zbMATH Keywords

line graphcyclecomplete graphpathedge-labeling

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (11)

• \(L(4, 3, 2, 1)\)-path coloring of certain classes of graphs
• \(L(1, 2)\)-edge-labelings for lattices
• The \(L(j,k)\)-edge-labeling problem on graphs.
• Optimal \(L(j,k)\)-edge-labeling of regular grids
• Improved bounds on the span of \(L(1,2)\)-edge labeling of some infinite regular grids
• \(\lambda\)-edge span of some almost regular graphs
• \(L(1,2)\)-edge-labeling for necklaces
• On circular-\(L\)(2,1)-edge-labeling of graphs
• Distance two edge labelings of lattices
• Real edge spans of distance two labelings of graphs
• The \(L (2, 1)\)-labeling number of two special graphs

This page was built for publication: On \(L(1,2)\)-edge-labelings of some special classes of graphs

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