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.
Combinatorica`
Combinatorica`
OddGraph
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
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 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.
Wolfram Research (2012)，OddGraph，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/OddGraph.html.
文本
Wolfram Research (2012)，OddGraph，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/OddGraph.html.
CMS
Wolfram 语言. 2012. "OddGraph." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/OddGraph.html.
APA
Wolfram 语言. (2012). OddGraph. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/OddGraph.html 年