Highly connected open access books, based on tri-grams
Uploaded on:
November 28, 2020
Description:
The graph is undirected.
The graph's vertices were grouped by connected component.
The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm.
The edge widths are based on counter values.
Overall Graph Metrics:
Vertices: 701
Unique Edges: 0
Edges With Duplicates: 4860
Total Edges: 4860
Self-Loops: 0
Reciprocated Vertex Pair Ratio: Not Applicable
Reciprocated Edge Ratio: Not Applicable
Connected Components: 19
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 652
Maximum Edges in a Connected Component: 4788
Maximum Geodesic Distance (Diameter): 12
Average Geodesic Distance: 4,521747
Graph Density: 0,0099042184634196
Modularity: 0,342441
NodeXL Version: 1.0.1.418
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: (Add your own word list)
[0] Non-categorized Words
[0] Total Words