An algorithm for construction of a k‐connected graph with minimum number of edges and quasiminimal diameter

This publication has 5 references indexed in Scilit:

• Maximum degree in graphs of diameter 2
  Networks, 1980
• On Moore graphs
  Mathematical Proceedings of the Cambridge Philosophical Society, 1973
• Analysis and Design of Reliable Computer Networks
  IEEE Transactions on Communications, 1972
• Analysis and Design of Survivable Networks
  IEEE Transactions on Communications, 1970
• Graphs with Maximal Even Girth
  Canadian Journal of Mathematics, 1969