You are here:
Publication details
BOUNDS FOR THE REAL NUMBER GRAPH LABELLINGS AND APPLICATION TO LABELLINGS OF THE TRIANGULAR LATTICE
Authors | |
---|---|
Year of publication | 2008 |
Type | Article in Periodical |
Magazine / Source | SIAM Journal on Discrete Mathematics |
Citation | |
Doi | http://dx.doi.org/10.1137/07068552X |
Keywords | real number graph labelling; channel assignment problem; graph labelling with distance conditions |
Description | We establish new lower and upper bounds for the real number graph labelling problem. As an application, we consider a problem of Griggs to determine the optimum spans of L(p, q)-labellings of the infinite triangular plane lattice and find (using a computer) the optimum spans for all p and q. |