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.
See Also
Tech Notes
Related Guides
-
▪
- Built-in Graphs ▪
- Graphs & Networks ▪
- Graph Visualization ▪
- Computation on Graphs ▪
- Graph Construction & Representation ▪
- Graphs and Matrices ▪
- Graph Properties & Measurements ▪
- Graph Operations and Modifications ▪
- Statistical Analysis ▪
- Social Network Analysis ▪
- Graph Properties ▪
- Mathematical Data Formats ▪
- Discrete Mathematics
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
BibTeX
@misc{reference.wolfram_2025_oddgraph, author="Wolfram Research", title="{OddGraph}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/OddGraph.html}", note=[Accessed: 04-December-2025]}
BibLaTeX
@online{reference.wolfram_2025_oddgraph, organization={Wolfram Research}, title={OddGraph}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/OddGraph.html}, note=[Accessed: 04-December-2025]}