NodeXLGraph1, 9/29/2020 4:31:26 AM, 236215


FAQ | Problem?

NodeXLGraph1
NodeXLGraph1
From:
Guest
Uploaded on:
September 29, 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.

Overall Graph Metrics:
Vertices: 30
Unique Edges: 341
Edges With Duplicates: 0
Total Edges: 341
Self-Loops: 26
Reciprocated Vertex Pair Ratio: Not Applicable
Reciprocated Edge Ratio: Not Applicable
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 30
Maximum Edges in a Connected Component: 341
Maximum Geodesic Distance (Diameter): 3
Average Geodesic Distance: 1.244444
Graph Density: 0.724137931034483
Modularity: 0.056359
NodeXL Version: 1.0.1.440
Tags:
 

We use necessary cookies to make our site work. We’d like to set additional cookies to understand site usage, make site improvements and to remember your settings. We also use cookies set by other sites to help deliver content from their services.