Wikipedia Article Network, Project for Awesome.xlsx
Uploaded on:
April 29, 2020
Description:
The graph is directed.
The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
The graph was laid out using the Fruchterman-Reingold layout algorithm.
Vertices : 13
Unique Edges : 27
Edges With Duplicates : 0
Total Edges : 27
Self-Loops : 1
Reciprocated Vertex Pair Ratio : 0.181818181818182
Reciprocated Edge Ratio : 0.307692307692308
Connected Components : 1
Single-Vertex Connected Components : 0
Maximum Vertices in a Connected Component : 13
Maximum Edges in a Connected Component : 27
Maximum Geodesic Distance (Diameter) : 4
Average Geodesic Distance : 1.810651
Graph Density : 0.166666666666667
Modularity : 0.229424
NodeXL Version : 1.0.1.432
Top Domains