On circular-L(2,1)-edge-labeling of graphs
From MaRDI portal
Publication:1936087
DOI10.11650/TWJM/1500406839zbMATH Open1259.05147OpenAlexW4232557406MaRDI QIDQ1936087FDOQ1936087
Authors: Wensong Lin, Jianzhuan Wu
Publication date: 21 February 2013
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: http://journal.taiwanmathsoc.org.tw/index.php/TJM/article/view/2629
Recommendations
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (9)
- Title not available (Why is that?)
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
- \(L(2,1)\)-circular-labelings of the edge-path-replacements.
- \(L(2, 1)\)-labeling of circulant graphs
- Distance two edge labelings of lattices
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
- On circular-L(2, 1)-labellings of products of graphs
- On \(L(1,2)\)-edge-labelings of some special classes of graphs
This page was built for publication: On circular-\(L\)(2,1)-edge-labeling of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1936087)