Combinatorica`
Combinatorica`

RegularGraph

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

RegularGraph[k,n]

constructs a semirandom k-regular graph on n vertices, if such a graph exists.

Details

Wolfram Research (2012), RegularGraph, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/RegularGraph.html.

Text

Wolfram Research (2012), RegularGraph, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/RegularGraph.html.

BibTeX

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

BibLaTeX

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

CMS

Wolfram Language. 2012. "RegularGraph." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/RegularGraph.html.

APA

Wolfram Language. (2012). RegularGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/RegularGraph.html