# Wolfram Language & System 10.3 (2015)|Legacy Documentation

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

# MeanNeighborDegree

gives a list of mean neighbor degrees of vertices for the graph g.

MeanNeighborDegree[g,"In"]
gives a list of mean neighbor in-degrees.

MeanNeighborDegree[g,"Out"]
gives a list of mean neighbor out-degrees.

MeanNeighborDegree[{vw,},]
uses rules to specify the graph g.

## DetailsDetails

• The mean neighbor degree is also known as the average neighbor degree.
• The mean neighbor degree of the vertex is the mean of vertex degrees of neighbors of .
• For weighted graphs, the mean neighbor degree of the vertex is given by over all neighbors of with edge weight between and . is the degree of the vertex and is the total of weights .
• MeanNeighborDegree works with undirected graphs, directed graphs, weighted graphs, multigraphs, and mixed graphs.

## ExamplesExamplesopen allclose all

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

Compute mean neighbor degrees:

 Out[2]=

Highlight:

 Out[3]=

Rank the vertices. Highest-ranked vertices are adjacent to high-degree vertices:

 Out[2]=

### Properties & Relations  (4)Properties & Relations  (4)

Introduced in 2012
(9.0)
| Updated in 2015
(10.3)