Tweet
window.twttr = (function (d, s, id) { var js, fjs = d.getElementsByTagName(s)[0], t = window.twttr || {}; if (d.getElementById(id)) return; js = d.createElement(s); js.id = id; js.src = "https://platform.twitter.com/widgets.js"; fjs.parentNode.insertBefore(js, fjs); t._e = []; t.ready = function (f) { t._e.push(f); }; return t; } (document, "script", "twitter-wjs"));

NodeXL_Quest1.xlsx

From:

Guest

Uploaded on:

April 16, 2018

Description:

The graph is undirected.

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

The graph was laid out using the Fruchterman-Reingold layout algorithm.

Overall Graph Metrics:

Vertices: 144

Unique Edges: 84

Edges With Duplicates: 0

Total Edges: 84

Self-Loops: 0

Reciprocated Vertex Pair Ratio: Not Applicable

Reciprocated Edge Ratio: Not Applicable

Connected Components: 60

Single-Vertex Connected Components: 0

Maximum Vertices in a Connected Component: 26

Maximum Edges in a Connected Component: 25

Maximum Geodesic Distance (Diameter): 2

Average Geodesic Distance: 1,5

Graph Density: 0,00815850815850816

Modularity: 0,903061

NodeXL Version: 1.0.1.396

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

The graph was laid out using the Fruchterman-Reingold layout algorithm.

Overall Graph Metrics:

Vertices: 144

Unique Edges: 84

Edges With Duplicates: 0

Total Edges: 84

Self-Loops: 0

Reciprocated Vertex Pair Ratio: Not Applicable

Reciprocated Edge Ratio: Not Applicable

Connected Components: 60

Single-Vertex Connected Components: 0

Maximum Vertices in a Connected Component: 26

Maximum Edges in a Connected Component: 25

Maximum Geodesic Distance (Diameter): 2

Average Geodesic Distance: 1,5

Graph Density: 0,00815850815850816

Modularity: 0,903061

NodeXL Version: 1.0.1.396

Tags: