\(L(2,1)\)-labeling of strong products of cycles

DOI10.1016/j.ipl.2005.01.007zbMath1182.68148OpenAlexW1550746253MaRDI QIDQ1041747

Aleksander Vesel, Danilo Korže

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.01.007

zbMATH Keywords

graph algorithmschannel assignmentstrong productdynamic algorithm\(2L(2,1)\)-labeling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

\(L(3,2,1)\)-labeling of triangular and toroidal grids ⋮ \(L(j, k)\)-number of direct product of path and cycle ⋮ \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles ⋮ Recent progress in mathematics and engineering on optimal graph labellings with distance conditions ⋮ The \(L(2,1)\)-labeling on Cartesian sum of graphs ⋮ \(L(p,q)\)-labeling and integer tension of a graph embedded on torus ⋮ \(L(2,1)\)-labeling for brick product graphs ⋮ L(h,k)-labelling for octagonal grid ⋮ DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE

Cites Work

• Unnamed Item
• Unnamed Item
• A randomised 3-colouring algorithm
• Relating path coverings to vertex labellings with a condition at distance two
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• Labelling Graphs with a Condition at Distance 2
• On the Shannon capacity of a graph
• Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]

This page was built for publication: \(L(2,1)\)-labeling of strong products of cycles