%23ElinaT%C9%99kDeyil_2019-11-08_06-07-07.xlsx (experimental version)

NOTE: This version of the graph is not available with the browser you are using. A
more recent version of the browser is required.

Go to the graph's main page
From:

NodeXLExcelAutomator

Uploaded on:

November 08, 2019

Description:

The graph represents a network of 0 Twitter users whose tweets in the requested range contained "#ElinaTəkDeyil", or who was replied to or mentioned in those tweets. The network was obtained from the NodeXL Graph Server on Friday, 08 November 2019 at 14:07 UTC.

The requested start date was Wednesday, 06 November 2019 at 01:01 UTC and the maximum number of days (going backward) was 14.

The maximum number of tweets collected was 5,000.

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.

The requested start date was Wednesday, 06 November 2019 at 01:01 UTC and the maximum number of days (going backward) was 14.

The maximum number of tweets collected was 5,000.

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.

Vertices : 0

Unique Edges : 0

Edges With Duplicates : 0

Total Edges : 0

Self-Loops : 0

Reciprocated Vertex Pair Ratio : Not Applicable

Reciprocated Edge Ratio : Not Applicable

Connected Components : 0

Single-Vertex Connected Components : 0

Maximum Vertices in a Connected Component : 0

Maximum Edges in a Connected Component : 0

Maximum Geodesic Distance (Diameter) : Not Applicable

Average Geodesic Distance : Not Applicable

Graph Density : Not Applicable

Modularity : Not Applicable

NodeXL Version : 1.0.1.421

Data Import : The graph represents a network of 0 Twitter users whose tweets in the requested range contained "%23ElinaT%C9%99kDeyil", or who was replied to or mentioned in those tweets. The network was obtained from the NodeXL Graph Server on Friday, 08 November 2019 at 14:07 UTC.

The requested start date was Wednesday, 06 November 2019 at 01:01 UTC and the maximum number of days (going backward) was 14.

The maximum number of tweets collected was 5,000.

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 : %23ElinaT%C9%99kDeyil

Groups : The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.

Unique Edges : 0

Edges With Duplicates : 0

Total Edges : 0

Self-Loops : 0

Reciprocated Vertex Pair Ratio : Not Applicable

Reciprocated Edge Ratio : Not Applicable

Connected Components : 0

Single-Vertex Connected Components : 0

Maximum Vertices in a Connected Component : 0

Maximum Edges in a Connected Component : 0

Maximum Geodesic Distance (Diameter) : Not Applicable

Average Geodesic Distance : Not Applicable

Graph Density : Not Applicable

Modularity : Not Applicable

NodeXL Version : 1.0.1.421

Data Import : The graph represents a network of 0 Twitter users whose tweets in the requested range contained "%23ElinaT%C9%99kDeyil", or who was replied to or mentioned in those tweets. The network was obtained from the NodeXL Graph Server on Friday, 08 November 2019 at 14:07 UTC.

The requested start date was Wednesday, 06 November 2019 at 01:01 UTC and the maximum number of days (going backward) was 14.

The maximum number of tweets collected was 5,000.

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 : %23ElinaT%C9%99kDeyil

Groups : The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.