# MeanDegreeConnectivity

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

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.

MeanDegreeConnectivity[{vw,},]

uses rules vw to specify the graph g.

# Details

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

# Examples

open allclose all

## Basic Examples(2)

Compute the mean degree connectivity for a graph:

 In[1]:=
 Out[1]=

Plot the mean degree connectivity:

 In[1]:=
 In[2]:=
 Out[2]=