HararyGraph

HararyGraph[k,n]

generates the minimal k-connected graph on n vertices .

Details and Options

Examples

open allclose all

Basic Examples  (1)

The first few Harary graphs with 8 vertices:

In[1]:=
Click for copyable input
Out[1]=

Options  (79)

Applications  (7)

Properties & Relations  (5)

Possible Issues  (1)

Neat Examples  (2)

See Also

Graph  GraphData  CirculantGraph  CompleteGraph  CycleGraph

Introduced in 2010
(8.0)