TV Assignment - Kara B.xlsx
Uploaded on:
February 27, 2019
Short Description:
Vertex size is measured by Eigenvector centrality
Vertex opacity is measured by closeness centrality
Vertex tooltip is measured by betweeness centrality.
Multiple interactions are shown using dashed lines
Edge width is measured by frequency
Description:
The graph is directed.
The graph's vertices were grouped by cluster using the Girvan-Newman 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 eigenvector centrality values. The vertex opacities are based on closeness centrality values.
Overall Graph Metrics:
Vertices: 8
Unique Edges: 18
Edges With Duplicates: 7
Total Edges: 25
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0.909090909090909
Reciprocated Edge Ratio: 0.952380952380952
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 8
Maximum Edges in a Connected Component: 25
Maximum Geodesic Distance (Diameter): 4
Average Geodesic Distance: 1.75
Graph Density: 0.375
Modularity: 0.1944
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