Wikipedia links (bh)

This network consists of the wikilinks of the Wikipedia in the Bhojpuri language (bh). Nodes are Wikipedia articles, and directed edges are wikilinks, i.e., hyperlinks within one wiki. In the wiki source, these are indicated with [[double brackets]]. Only pages in the article namespace are included.


Internal namewikipedia_link_bh
NameWikipedia links (bh)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops


Size n =14,667
Volume m =369,529
Loop count l =10
Wedge count s =80,876,605
Claw count z =17,503,744,592
Cross count x =4,475,881,107,522
Triangle count t =6,094,914
Square count q =5,467,454,464
4-Tour count T4 =44,063,721,192
Maximum degree dmax =2,386
Maximum outdegree d+max =419
Maximum indegree dmax =2,123
Average degree d =50.389 2
Fill p =0.001 717 77
Size of LCC N =14,650
Size of LSCC Ns =5,234
Relative size of LSCC Nrs =0.356 856
Diameter δ =9
50-Percentile effective diameter δ0.5 =3.791 05
90-Percentile effective diameter δ0.9 =5.127 98
Median distance δM =4
Mean distance δm =4.236 70
Gini coefficient G =0.798 049
Relative edge distribution entropy Her =0.862 019
Power law exponent γ =1.534 82
Tail power law exponent γt =1.921 00
Degree assortativity ρ =+0.127 288
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.660 340
Clustering coefficient c =0.226 082
Directed clustering coefficient c± =0.877 512
Spectral norm α =416.467
Operator 2-norm ν =380.606
Cyclic eigenvalue π =128.023
Algebraic connectivity a =0.017 976 2
Reciprocity y =0.432 951
Non-bipartivity bA =0.165 210
Normalized non-bipartivity bN =0.004 667 11
Spectral bipartite frustration bK =8.815 77 × 10−5


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

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 ]