An example of an ordinal proximity matrix for n = 5 is given as matrix D1.
Figure 3: Ordinal Proximity Matrix
A threshold graph is an undirected, unweighted graph on n nodes without self loops or multiple edges. Each node represents an object. A threshold graph G(v) is defined for each dissimilarity level v by inserting an edge (i,j) between nodes i and j if objects i and j are less dissimilar than v. That is,
if and only if d(i,j) <= v