Description

The following directed graph represents a citation network wherein an edge i –> j indicates paper i has cited paper j as one of its references. Determine a weighted symmetric matrix such that for an entry (i, j): the value in the matrix indicates the number of papers each of which have cited both i and j together as references.