Guest

July 27, 2023

The graph was imported from the open matrix workbook "coocc.dbf".

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 Fruchterman-Reingold layout algorithm.

Overall Graph Metrics:
Vertices: 380
Unique Edges: 159
Edges With Duplicates: 494
Total Edges: 653
Self-Loops: 0
Reciprocated Vertex Pair Ratio: Not Applicable
Reciprocated Edge Ratio: Not Applicable
Connected Components: 129
Single-Vertex Connected Components: 112
Maximum Vertices in a Connected Component: 218
Maximum Edges in a Connected Component: 589
Maximum Geodesic Distance (Diameter): 11
Average Geodesic Distance: 3.891646
Graph Density: 0.0056381058186363
Modularity: 0.492797
NodeXL Version: 1.0.1.517