Abstract
We prove a conjecture of R. L. Graham and H. O. Pollak to the effect that every connected graph onn vertices has a distance-preserving embedding in “squashed cube” of dimensionn−1. This means that to each vertex of the graph a string ofn−1 symbols from the alphabet {0, 1, *} can be assigned in such a way that the length of the shortest path between two vertices is equal to the Hamming distance between the corresponding strings, with * being regarded as at distance zero from either 1 or 0. Our labelling thus provides an efficient addressing scheme for the loop-switching communications system proposed by J. R. Pierce.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. L. Graham andH. O. Pollak, On the addressing problem for loop switching,Bell System Tech. J. 50 (1971), 2495–2519.
R. L. Graham andH. O. Pollak, On embedding graphs in squashed cubes,Graph Theory and Applications, Lecture Notes in Mathematics303, Springer-Verlag (Proc. of a conference held at Western Michigan University, May 10–13, 1972).
J. R. Pierce, Network for block switching of data,Bell System Tech. J. 51 (1972), 1133–1145.
P. M. Winkler, Every connected graph is a query graph,J. Combinatorics, Information and System Sciences, to appear.
A. C.-C. Yao, On the loop switching addressing problem,SIAM J. on Computing, Vol. 7 No. 4 (1978), 515–523.