1664 search results - page 1 / 333 » Distance labeling in graphs |
SIAMDM
2008
13 years 4 months ago
2008
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 infin...
JAL
2006
13 years 4 months ago
2006
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...
ENDM
2007
13 years 4 months ago
2007
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ b...
JCO
2007
13 years 4 months ago
2007
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...