Guest

July 27, 2023

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

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.

The edge widths are based on vertex 1 group values. The edge opacities are based on edge weight values. The vertex sizes are based on betweenness centrality values.

Overall Graph Metrics:
Vertices: 267
Unique Edges: 654
Edges With Duplicates: 0
Total Edges: 654
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0.614814814814815
Reciprocated Edge Ratio: 0.761467889908257
Connected Components: 17
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 218
Maximum Edges in a Connected Component: 592
Maximum Geodesic Distance (Diameter): 11
Average Geodesic Distance: 3.891928
Graph Density: 0.00920841429416237
Modularity: 0.490585
NodeXL Version: 1.0.1.517