InDegree[g,n]
returns the in-degree of vertex n in directed graph .
InDegree[g]
returns the sequence of in-degrees of the vertices in directed graph .


InDegree
InDegree[g,n]
returns the in-degree of vertex n in directed graph .
InDegree[g]
returns the sequence of in-degrees of the vertices in directed graph .
Details and Options
- InDegree functionality is now available in the built-in Wolfram Language function VertexInDegree.
- To use InDegree, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Examples
Basic Examples (2)
InDegree has been superseded by VertexInDegree:
See Also
Tech Notes
Related Guides
-
▪
- Graph Properties ▪
- 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), InDegree, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/InDegree.html.
CMS
Wolfram Language. 2012. "InDegree." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/InDegree.html.
APA
Wolfram Language. (2012). InDegree. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/InDegree.html
BibTeX
@misc{reference.wolfram_2025_indegree, author="Wolfram Research", title="{InDegree}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/InDegree.html}", note=[Accessed: 09-August-2025]}
BibLaTeX
@online{reference.wolfram_2025_indegree, organization={Wolfram Research}, title={InDegree}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/InDegree.html}, note=[Accessed: 09-August-2025]}