info prev up next book cdrom email home

Vertex Degree

The degree of a Vertex of a Graph is the number of Edges which touch the Vertex, also called the Local Degree. The Vertex degree of a point $A$ in a Graph, denoted $\rho(A)$, satisfies

\sum_{i=1}^n \rho(A_i)=2 E,

where $E$ is the total number of Edges. Directed Graphs have two types of degrees, known as the Indegree and the Outdegree.

See also Directed Graph, Indegree, Local Degree, Outdegree

© 1996-9 Eric W. Weisstein