Wolfram Language & System 10.4 (2016)|Legacy Documentation

This is documentation for an earlier version of the Wolfram Language.View current documentation (Version 11.2)


gives the Dice similarity between vertices u and v of the graph g.

uses rules to specify the graph g.


  • The vertex Dice similarity is the number of common neighbors of u and v divided by half the sum of the degrees of u and v.
  • VertexDiceSimilarity works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Introduced in 2012
| Updated in 2015