WLJS LogoWLJS Notebook

VertexDiceSimilarity

VertexDiceSimilarity[g, u, v] gives the Dice similarity between vertices u and v of the graph g.

  • VertexDiceSimilarity[{v -> w, ...}, ...] uses rules v -> w to specify the graph g.

The Dice similarity measures the overlap between the neighborhoods of two vertices.

Examples

g = Graph[{1 <-> 2, 2 <-> 3, 3 <-> 4, 1 <-> 3}];
VertexDiceSimilarity[g, 1, 3]
VertexDiceSimilarity[CompleteGraph[5], 1, 2]
VertexDiceSimilarity[{1 -> 2, 2 -> 3, 1 -> 3}, 1, 2]

*See the official Wolfram Language Reference for more details.

On this page