Solution

Past exam of the mathematics course of the University of Cambridge / 2008 / ii / Paper 1 / 17F / iii / Solution

Past exam of the mathematics course of the University of Cambridge / 2008 / ii / Paper 1 / 17F / ii / Solution

{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>.

Codex @codex  0

 Incoming links: Average degree of a graph