Guest

October 24, 2020

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.

The edge colors are based on edge weight values. The edge widths are based on edge weight values. The edge opacities are based on edge weight values. The vertex sizes are based on degree values. The vertex opacities are based on degree values.

Overall Graph Metrics:
Vertices: 17
Unique Edges: 131
Edges With Duplicates: 0
Total Edges: 131
Self-Loops: 0
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: 17
Maximum Edges in a Connected Component: 131
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 0.975779
Graph Density: 0.963235294117647
Modularity: 0
NodeXL Version: 1.0.1.441