NodeXLGraph1, 12/13/2019 12:22:45 AM, 218777


FAQ | Problem?

NodeXLGraph1
NodeXLGraph1
From:
KSTCAT
Uploaded on:
December 13, 2019
Description:
The graph is directed.

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.

Overall Graph Metrics:
Vertices: 500
Unique Edges: 202
Edges With Duplicates: 0
Total Edges: 202
Self-Loops: 41
Reciprocated Vertex Pair Ratio: 0.15
Reciprocated Edge Ratio: 0.260869565217391
Connected Components: 384
Single-Vertex Connected Components: 336
Maximum Vertices in a Connected Component: 20
Maximum Edges in a Connected Component: 41
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance: 1.857143
Graph Density: 0.000645290581162325
Modularity: 0.753805
NodeXL Version: 1.0.1.422

Top 10 Vertices, Ranked by Betweenness Centrality:
1264
187
2137
2015
2088
1702
2250
1452
1716
493

Top Words in Tweet in Entire Graph:
[0] Words in Sentiment List#1: Positive
[0] Words in Sentiment List#2: Negative
[0] Words in Sentiment List#3: Angry/Violent
[0] Non-categorized Words
[0] Total Words

We use necessary cookies to make our site work. We’d like to set additional cookies to understand site usage, make site improvements and to remember your settings. We also use cookies set by other sites to help deliver content from their services.