Average Vertex Degree of Connected Graphs

Although simple, the average vertex degree of a connected graph is quite interesting. For example, in graphs where the vertex degree
K
is constant, the number of nodes reached by extending out
r
nodes from a single node is
K
r
. For graphs where the vertex degrees are not all the same, and taking all vertices into account, the value of
A
r
, where
A
is the average vertex degree, provides another similar perspective.

Details

For more information on the degree of a vertex of a graph, see http://en.wikipedia.org/wiki/Degree_%28 graph_theory %29. For more on degree distribution, see http://en.wikipedia.org/wiki/Degree_distribution.

External Links

Graph (Wolfram MathWorld)
Space as a Network (NKS|Online)
Vertex Degree (Wolfram MathWorld)
Degree Sequence (Wolfram MathWorld)

Permanent Citation

John Cicilio
​
​"Average Vertex Degree of Connected Graphs"​
​http://demonstrations.wolfram.com/AverageVertexDegreeOfConnectedGraphs/​
​Wolfram Demonstrations Project​
​Published: December 15, 2010