TransitiveReduction[g]
finds a smallest graph that has the same transitive closure as g.
TransitiveReduction
TransitiveReduction[g]
finds a smallest graph that has the same transitive closure as g.
Details and Options
- TransitiveReduction functionality is now available in the built-in Wolfram Language function TransitiveReductionGraph .
- To use TransitiveReduction, you first need to load the Combinatorica Package using Needs ["Combinatorica`"].
Examples
Basic Examples (2)
InDegree has been superseded by VertexInDegree :
Tech Notes
Related Guides
-
▪
- Graph Algorithms ▪
- 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), TransitiveReduction, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html.
CMS
Wolfram Language. 2012. "TransitiveReduction." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html.
APA
Wolfram Language. (2012). TransitiveReduction. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html
BibTeX
@misc{reference.wolfram_2025_transitivereduction, author="Wolfram Research", title="{TransitiveReduction}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html}", note=[Accessed: 04-December-2025]}
BibLaTeX
@online{reference.wolfram_2025_transitivereduction, organization={Wolfram Research}, title={TransitiveReduction}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html}, note=[Accessed: 04-December-2025]}