gives a list of k-mean degree connectivity for the graph g for successive k=0,1,2 .


gives a list of k-mean in-degree connectivity for the graph g.


gives a list of k-mean out-degree connectivity for the graph g.


uses rules vw to specify the graph g.


  • The mean degree connectivity is also known as average degree connectivity and average nearest neighbor degree.
  • The k-mean degree connectivity is the average of the mean neighbor degrees of vertices of degree k.
  • MeanDegreeConnectivity[g] returns a list {m0,m1,,md}, where mk is the k-mean degree connectivity and d is the maximum vertex degree in g.
  • MeanDegreeConnectivity works with undirected graphs, directed graphs, weighted graphs, multigraphs, and mixed graphs.


open allclose all

Basic Examples  (2)

Compute the mean degree connectivity for a graph:

Plot the mean degree connectivity:

Scope  (8)

MeanDegreeConnectivity works with undirected graphs:

Directed graphs:

Weighted graphs:


Mixed graphs:

Use rules to specify the graph:

Compute the mean in- and out-degree connectivity:

MeanDegreeConnectivity works with large graphs:

Properties & Relations  (1)

MeanDegreeConnectivity[g][[k+1]] gives the k-mean degree connectivity:

It is a mean of MeanNeighborDegree:

Introduced in 2012
Updated in 2014