1. N.L. Biggs, Algebraic graph theory, Second Edition, Cambridge University Press (Cambridge 1993).
2. B. Bollobás and W. Fernandez de la Vega, The diameter of random regular graphs, Combinatorica 2 (2) (1982) pp. 125–134.
3. T. Hagerup and C. Rüb, A guided tour of Chernoff bounds, Information Processing Letters 33/6 (1989/90) pp. 305–308.
4. F.T. Leighton, Introduction to parallel algorithms and architectures: arrays·trees·hypercubes, Morgan Kaufmann Publishers (San Mateo, CA 1992).
5. F.T. Leighton and B.M. Maggs, Fast algorithms for finding O(congestion+dilation) packet routing schedules, Unpublished Manuscript (1994).