HararyGraph

HararyGraph[k,n] generates the minimal k-connected graph on n vertices Hk,n.

Examples

Generate a 3-connected Harary graph on 8 vertices:

HararyGraph[3, 8]
(* Graph[...] *)

Please visit the official Wolfram Language Reference for more details.