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 k-connected graph on n vertices.

Details

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.

BibTeX

@misc{reference.wolfram_2021_harary, author="Wolfram Research", title="{Harary}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/Harary.html}", note=[Accessed: 27-September-2021 ]}

BibLaTeX

@online{reference.wolfram_2021_harary, organization={Wolfram Research}, title={Harary}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/Harary.html}, note=[Accessed: 27-September-2021 ]}

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