Average degree of a graph
= Average degree of a graph
{title2=$\overline d(G)=2e(G)/|V(G)|$}
The average <vertex degree> of a <graph> is the sum of its vertex degrees divided by its order. <Double counting> edge endpoints gives $\overline d(G)=2e(G)/|V(G)|$. It lies between the <minimum degree of a graph> and the <maximum degree of a graph>.