Citation networks


Graph Drawing 2001 Contest - Graph A

Graph Drawing 2001 Contest task description for Graph A.
Graph A in Pajek's format.

Selected citation networks from Garfield's collection

Citation networks in Pajek's format obtained from the Garfield's collection of citation network datasets produced using HistCite software. All of these networks are the result of searches in the WebofScience and are used with the permission of ISI of Philadelphia. Please acknowledge this when publishing results based on these data.

network n m m0 n0 nC kC h Δi Δo 2 3 4
DNA 40 60 0 1 35 3 11 7 5 0 0 0
Small World 396 1988 0 163 233 1 16 60 294 0 0 0
Small & Griffith and Descendants 1059 4922 1 35 1024 1 28 89 232 2 0 0
Scientometrics 3084 10416 1 355 2678 21 32 121 105 5 2 1
Self-organizing maps 4470 12731 2 698 3704 27 24 51 735 11 0 0
Zewail 6752 54253 1 101 6640 5 75 166 227 38 1 2
Lederberg 8843 41609 7 519 8212 35 63 135 1098 54 4 0

n - number of vertices
m - and number of arcs
m0 - number of loops
n0 - number of isolated vertices
nC - size of the largest weakly connected component
kC - number of nontrivial weakly connected components
h - depth - number of levels
Δi - maximum input degree
Δo - maximum output degree
In last three columns are the numbers of strongly connected components (cyclic parts) of size 2, 3 and 4.


Some references


Network Data, Pajek, Vlado