\(L(2,1)\)-labelings on the modular product of two graphs

DOI10.1016/J.TCS.2013.02.002zbMath1283.05246OpenAlexW213233986MaRDI QIDQ387006

Roberto Solis-Oba, Zhendong Shao

Publication date: 11 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.02.002

zbMATH Keywords

\(L(2,1)\)-labelinggraph modular product

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

\(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs ⋮ The minimum span of \(L(2,1)\)-labelings of generalized flowers ⋮ Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two ⋮ Local colourings of Cartesian product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(L(2,1)\)-labeling on planar graphs
• Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
• \(L(2,1)\)-labelings on the composition of \(n\) graphs
• The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
• \(T\)-colorings of graphs: recent results and open problems
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
• On the \(L(p,1)\)-labelling of graphs
• A survey on labeling graphs with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• The L(2,1)-labeling and operations of graphs
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: \(L(2,1)\)-labelings on the modular product of two graphs