1. A problem of the theory of communication networks
2. 2. B. Bollobas, G. Katona, and P. Erdos, 1968 . Graphs of given diameter. Theory of Graphs. Proc. Colloq. (held at Tihany, Hungary) . Academic Press, New York, N.Y.pp.29 -36 .
3. 4. B. Bollobas, and F. Hoffman, 1976 . Strongly two connected graphs. Congr. Numerantium XVII. Proc. Seventh Southeastern Conf. Combinatorics, Graph Theory, Comput. Baton Rouge, La . Utilitas Math., Winnipeg, Manitoba, Canada. 161 -170 .