Guest

April 17, 2023

The graph was imported from the open workbook "data menlu.xlsx".

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: 312
Unique Edges: 199
Edges With Duplicates: 2523
Total Edges: 2722
Self-Loops: 1832
Reciprocated Vertex Pair Ratio: Not Applicable
Reciprocated Edge Ratio: Not Applicable
Connected Components: 2
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 310
Maximum Edges in a Connected Component: 2721
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 1.987056
Graph Density: 0.00638964465331025
Modularity: 0.101142
NodeXL Version: 1.0.1.511