Sciweavers

SIAMDM
2010
99views more  SIAMDM 2010»
13 years 3 months ago
Edge-Injective and Edge-Surjective Vertex Labellings
For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...
Stephan Brandt, Jozef Miskuf, Dieter Rautenbach, F...