 |
BUILT-IN MATHEMATICA SYMBOL
HararyGraph
HararyGraph[k, n]
generates the minimal k-connected graph on n vertices 
.
Details and Options
- HararyGraph[k, n] is a graph with n vertices and
![TemplateBox[{{k, , {n, /, 2}}}, Ceiling]](Files/HararyGraph.en/2.png "TemplateBox[{{k, , {n, /, 2}}}, Ceiling]")
edges that is k-connected. - HararyGraph takes the same options as Graph.
Examplesopen all
Basic Examples (1)
The first few Harary graphs with 8 vertices:
| In[1]:= |
| Out[1]= |  |
New in 8
