semantic network .xlsx
Uploaded on:
April 04, 2023
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: 134
Unique Edges: 144
Edges With Duplicates: 4
Total Edges: 148
Self-Loops: 0
Reciprocated Vertex Pair Ratio: Not Applicable
Reciprocated Edge Ratio: Not Applicable
Connected Components: 13
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 102
Maximum Edges in a Connected Component: 128
Maximum Geodesic Distance (Diameter): 11
Average Geodesic Distance: 4.667492
Graph Density: 0.016384244192571
Modularity: 0.721603
NodeXL Version: 1.0.1.508