TOPICS
Search

Local Degree


The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a graph, denoted rho(A), satisfies

 sum_(i=1)^nrho(A_i)=2E,

where E is the total number of graph edges. Directed graphs have two types of degrees, known as the indegree and outdegree.


See also

Indegree, Outdegree

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Local Degree." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/LocalDegree.html

Subject classifications