Sciweavers

Share
SIAMDM
2008

Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice

10 years 11 months ago
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infinite triangular plane lattice (solving an open problem of Griggs). Key words. real number graph labelling, channel assignment problem, graph labelling with distance conditions AMS subject classifications. 05C15
Daniel Král, Petr Skoda
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2008
Where SIAMDM
Authors Daniel Král, Petr Skoda
Comments (0)
books