Wolfram Language & System 10.0 (2014)|Legacy Documentation
gives a list of k-mean degree connectivity for the graph g for successive .
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.
- 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 , where 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.