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 vertex sizes are based on degree values. The vertex opacities are based on degree values.

Overall Graph Metrics:
Vertices: 17
Unique Edges: 134
Edges With Duplicates: 0
Total Edges: 134
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: 134
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 0.955017
Graph Density: 0.985294117647059
Modularity: 0
NodeXL Version: 1.0.1.441