SMRFoundation

April 19, 2024

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 betweenness centrality values.

Overall Graph Metrics:
Vertices: 29
Unique Edges: 43
Edges With Duplicates: 0
Total Edges: 43
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0
Reciprocated Edge Ratio: 0
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 29
Maximum Edges in a Connected Component: 43
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance: 2.97503
Graph Density: 0.0529556650246305
Modularity: 0.458626
NodeXL Version: 1.0.1.530

#nxlgpt