Guest

August 16, 2022

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: 12
Unique Edges: 15
Edges With Duplicates: 0
Total Edges: 15
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: 12
Maximum Edges in a Connected Component: 15
Maximum Geodesic Distance (Diameter): 5
Average Geodesic Distance: 2.194444
Graph Density: 0.227272727272727
Modularity: 0.3
NodeXL Version: 1.0.1.503