Guest

October 23, 2020

The graph is undirected.

The graph's vertices were grouped by cluster using the Girvan-Newman 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.

Overall Graph Metrics:
Vertices: 32
Unique Edges: 276
Edges With Duplicates: 0
Total Edges: 276
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: 32
Maximum Edges in a Connected Component: 276
Maximum Geodesic Distance (Diameter): 3
Average Geodesic Distance: 1.523438
Graph Density: 0.556451612903226
Modularity: 0.024069
NodeXL Version: 1.0.1.441