# VertexDiceSimilarity

VertexDiceSimilarity[g,u,v]

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

VertexDiceSimilarity[{vw,},]

uses rules vw to specify the graph g.

# Details • VertexDiceSimilarity is also known as the SørensenDice index or the Dice coefficient.
• 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.

# Examples

open allclose all

## Basic Examples(1)

Dice similarity between two vertices in a graph:

## Scope(6)

VertexDiceSimilarity works with undirected graphs:

Directed graphs:

Multigraphs:

Mixed graphs:

Use rules to specify the graph:

VertexDiceSimilarity works with large graphs:

## Properties & Relations(3)

Use DiceDissimilarity to compute the Dice similarity of a graph:

The Dice similarity between two vertices is equal to zero if one of them has degree zero:

The Dice similarity between two vertices is equal to 1 if they have the same neighbors: