Dijkstra, E.W. (1959). A note on two problems in connexion with graphs. Numer. Math.; 1, 269-71.
Dreyfus, S.E. (1969). An appraisal of some shortest-path algorithms. Operations Res., 17, 395-412
Erdos, P. and Gallai, T. (1960). Graphs with prescribed degrees of vertices (Hungarian). Mat. Lapok, 11, 264-74.
Hoffman, A. J. and Singleton, R.R. (1960). On Moore graphs with diameters 2 and 3. IBM J. Res. Develop., 4, 497-504.