Harary
Harary[k,n]
constructs the minimal 
-connected graph on 
vertices.
Combinatorica`
Combinatorica`
Harary
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
Harary[k,n]
constructs the minimal 
-connected graph on 
vertices.
Details and Options
- Harary functionality is now available in the built-in Wolfram Language function HararyGraph.
- To use Harary, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Wolfram Research (2012), Harary, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/Harary.html.
Text
Wolfram Research (2012), Harary, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/Harary.html.
CMS
Wolfram Language. 2012. "Harary." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/Harary.html.
APA
Wolfram Language. (2012). Harary. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/Harary.html