These are cross references between entries in the Free On-line Dictionary of Computing (FOLDOC, Nodes are entries, and a directed edge from term A to term B denotes that the term B is used in the definition of term A. There are multiple edges, denoted multiple uses of the same term.


Internal namefoldoc
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Hyperlink network
Dataset timestamp 2002
Node meaningTerm
Edge meaningUse
Network formatUnipartite, directed
Edge typeUnweighted, multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsDoes not contain loops


Size n =13,356
Volume m =125,207
Unique edge count m̿ =120,238
Loop count l =0
Wedge count s =2,762,280
Claw count z =199,487,042
Cross count x =22,160,884,702
Triangle count t =104,225
Square count q =739,721
4-Tour count T4 =17,149,830
Maximum degree dmax =752
Maximum outdegree d+max =102
Maximum indegree dmax =720
Average degree d =18.749 2
Fill p =0.000 674 096
Average edge multiplicity m̃ =1.041 33
Size of LCC N =13,356
Size of LSCC Ns =13,274
Relative size of LSCC Nrs =0.993 860
Diameter δ =8
50-Percentile effective diameter δ0.5 =3.506 44
90-Percentile effective diameter δ0.9 =4.581 42
Median distance δM =4
Mean distance δm =3.990 87
Gini coefficient G =0.254 314
Relative edge distribution entropy Her =0.983 667
Power law exponent γ =1.736 78
Tail power law exponent γt =2.891 00
Tail power law exponent with p γ3 =2.891 00
p-value p =0.646 000
Outdegree tail power law exponent with p γ3,o =5.461 00
Outdegree p-value po =0.009 000 00
Indegree tail power law exponent with p γ3,i =2.581 00
Indegree p-value pi =0.185 000
Degree assortativity ρ =−0.012 124 7
Degree assortativity p-value pρ =2.147 62 × 10−7
In/outdegree correlation ρ± =+0.308 011
Clustering coefficient c =0.113 195
Spectral norm α =54.592 5
Operator 2-norm ν =46.239 4
Cyclic eigenvalue π =15.718 2
Algebraic connectivity a =0.908 859
Reciprocity y =0.478 501
Non-bipartivity bA =0.152 740
Normalized non-bipartivity bN =0.435 186
Spectral bipartite frustration bK =0.047 775 1


Fruchterman–Reingold graph drawing

Degree distribution

Cumulative degree distribution

Lorenz curve

Spectral distribution of the adjacency matrix

Spectral distribution of the normalized adjacency matrix

Spectral distribution of the Laplacian

Spectral graph drawing based on the adjacency matrix

Spectral graph drawing based on the Laplacian

Spectral graph drawing based on the normalized adjacency matrix

Degree assortativity

Zipf plot

Hop distribution

Double Laplacian graph drawing

Delaunay graph drawing

In/outdegree scatter plot

Edge weight/multiplicity distribution

Clustering coefficient distribution

Average neighbor degree distribution


Matrix decompositions plots



[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]
[2] V. Batagelj, A. Mrvar, and M. Zavešnik. Network analysis of texts. In Language Technologies, pages 143–148, 2002.