The graph represents a network of 4 Twitter users whose tweets in the requested range contained "unmcilead", or who were replied to or mentioned in those tweets. The network was obtained from the NodeXL Graph Server on Wednesday, 18 May 2022 at 01:29 UTC.
The requested start date was Wednesday, 18 May 2022 at 00:01 UTC and the maximum number of days (going backward) was 14.
The maximum number of tweets collected was 7,500.
The tweets in the network were tweeted over the 0-minute period from Thursday, 05 May 2022 at 20:30 UTC to Thursday, 05 May 2022 at 20:30 UTC.
There is an edge for each "replies-to" relationship in a tweet, an edge for each "mentions" relationship in a tweet, and a self-loop edge for each tweet that is not a "replies-to" or "mentions".
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.
Author Description
Vertices : 4
Unique Edges : 3
Edges With Duplicates : 0
Total Edges : 3
Number of Edge Types : 1
Mentions : 3
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 : 4
Maximum Edges in a Connected Component : 3
Maximum Geodesic Distance (Diameter) : 2
Average Geodesic Distance : 1.125
Graph Density : 0.25
Modularity : 0
NodeXL Version : 1.0.1.449
Data Import : The graph represents a network of 4 Twitter users whose tweets in the requested range contained "unmcilead", or who were replied to or mentioned in those tweets. The network was obtained from the NodeXL Graph Server on Wednesday, 18 May 2022 at 01:29 UTC.
The requested start date was Wednesday, 18 May 2022 at 00:01 UTC and the maximum number of days (going backward) was 14.
The maximum number of tweets collected was 7,500.
The tweets in the network were tweeted over the 0-minute period from Thursday, 05 May 2022 at 20:30 UTC to Thursday, 05 May 2022 at 20:30 UTC.
There is an edge for each "replies-to" relationship in a tweet, an edge for each "mentions" relationship in a tweet, and a self-loop edge for each tweet that is not a "replies-to" or "mentions".
Layout Algorithm : The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm.
Graph Source : GraphServerTwitterSearch
Graph Term : unmcilead
Groups : The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
Edge Color : Edge Weight
Edge Width : Edge Weight
Edge Alpha : Edge Weight
Vertex Radius : Betweenness Centrality
Top Domains
Top Mentioned in Entire Graph:
Top Mentioned in G1:
Top Tweeters in Entire Graph:
Top Tweeters in G1: