# 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 vw to specify the graph g.

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

# Examples

open all close all

## Basic Examples(2)

Compute mean neighbor degrees:

 In:= In:= Out= Highlight:

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

 In:= In:= Out= ## Properties & Relations(4)

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