Kelvin UW Tv Assignment.xlsx
Uploaded on:
February 27, 2019
Short Description:
Vertex Size= Degree
Vertex Opacity= Eigenvector Centrality
Vertex Tooltip= Betweenness Centrality
Edge Width= Frequency
Yellow= Talking
Purple= Chase
Orange= Scared
Maroon= Kidnap
Cyan= Rescue
Wakita-Tsurumi cluster algorithm
Red= Giving Scooby Snacks
Blue= Hugging
Green= Carrying Scooby
Description:
The graph is directed.
The graph's vertices were grouped by cluster using the Wakita-Tsurumi cluster algorithm.
The graph was laid out using the Fruchterman-Reingold layout algorithm.
The edge widths are based on frequency values. The vertex sizes are based on degree values. The vertex opacities are based on eigenvector centrality values.
Overall Graph Metrics:
Vertices: 12
Unique Edges: 39
Edges With Duplicates: 8
Total Edges: 47
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0.102564102564103
Reciprocated Edge Ratio: 0.186046511627907
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 12
Maximum Edges in a Connected Component: 47
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 1.291667
Graph Density: 0.325757575757576
Modularity: 0.116116
NodeXL Version: 1.0.1.409
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