\(L(2,1)\)-labelling of generalized prisms

DOI10.1016/j.dam.2011.07.025zbMath1241.05122OpenAlexW134456851MaRDI QIDQ415277

Karina Chudá, Martin Škoviera

Publication date: 11 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.07.025

zbMATH Keywords

\(L(21)\)-labellingcovering projectiongraph product

Mathematics Subject Classification ID

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

Related Items (5)

Distance edge coloring and collision‐free communication in wireless sensor networks ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs ⋮ Tree 3-spanners on generalized prisms of graphs ⋮ Local colourings of Cartesian product graphs

Cites Work

• Unnamed Item
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• On generalized Petersen graphs labeled with a condition at distance two
• On the \(L(p,1)\)-labelling of graphs
• A survey on labeling graphs with a condition at distance two
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
• Labelling Graphs with a Condition at Distance 2
• On Regular Graphs Optimally Labeled with a Condition at Distance Two
• Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
• The L(2,1)-labeling and operations of graphs

This page was built for publication: \(L(2,1)\)-labelling of generalized prisms