Konser BPIP (experimental version)
NOTE: This version of the graph is not available with the browser you are using. A
more recent version of the browser is required.
Go to the graph's main page
Uploaded on:
May 23, 2020
Description:
The graph is undirected.
The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm.
Author Description
Vertices : 91
Unique Edges : 194
Edges With Duplicates : 431
Total Edges : 625
Self-Loops : 0
Reciprocated Vertex Pair Ratio : Not Applicable
Reciprocated Edge Ratio : Not Applicable
Connected Components : 24
Single-Vertex Connected Components : 22
Maximum Vertices in a Connected Component : 67
Maximum Edges in a Connected Component : 624
Maximum Geodesic Distance (Diameter) : 4
Average Geodesic Distance : 2,222123
Graph Density : 0,0786324786324786
Modularity : 0,214803
NodeXL Version : 1.0.1.433
Top Domains