# Wolfram Language & System 10.0 (2014)|Legacy Documentation

This is documentation for an earlier version of the Wolfram Language.
BUILT-IN WOLFRAM LANGUAGE SYMBOL

# MeanDegreeConnectivity

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

MeanDegreeConnectivity[g,"In"]
gives a list of k-mean in-degree connectivity for the graph g.

MeanDegreeConnectivity[g,"Out"]
gives a list of k-mean out-degree connectivity for the graph g.

## DetailsDetails

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

## ExamplesExamplesopen allclose all

### Basic Examples  (2)Basic Examples  (2)

Compute the mean degree connectivity for a graph:

 Out[1]=

Plot the mean degree connectivity:

 Out[2]=