OddGraph[n]
returns the graph whose vertices are the size 
subsets of a size 
set and whose edges connect pairs of vertices that correspond to disjoint subsets.
OddGraph
OddGraph[n]
returns the graph whose vertices are the size 
subsets of a size 
set and whose edges connect pairs of vertices that correspond to disjoint subsets.
Details and Options
- OddGraph functionality is now available in the built-in Wolfram Language function GraphData.
- To use OddGraph, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
- OddGraph[3] is the Petersen graph.
Text
Wolfram Research (2012), OddGraph, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/OddGraph.html.
CMS
Wolfram Language. 2012. "OddGraph." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/OddGraph.html.
APA
Wolfram Language. (2012). OddGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/OddGraph.html