gives a list of mean neighbor degrees of vertices for the graph g.
gives a list of mean neighbor in-degrees.
gives a list of mean neighbor out-degrees.
uses rules vw to specify the graph g.
- 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.
Examplesopen allclose all
Basic Examples (2)
Properties & Relations (4)
Use VertexDegree to compute the mean neighbor degree:
MeanDegreeConnectivity gives the means over vertices gathered by degree:
Wolfram Research (2012), MeanNeighborDegree, Wolfram Language function, https://reference.wolfram.com/language/ref/MeanNeighborDegree.html (updated 2015).
Wolfram Language. 2012. "MeanNeighborDegree." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/MeanNeighborDegree.html.
Wolfram Language. (2012). MeanNeighborDegree. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/MeanNeighborDegree.html