Answer question a d e f g h using The R program 1 Answer the

1. Answer the following questions about this graph. a. What is the degree distribution for th graph? b. What is the density of this graph? c. Draw the 1.5 egocentric network of node G. d. Which node(s) have the highest degree? What is the degree? e. Which node(s) have the lowest degree? What is the degree? f. Which node has the highest closeness centrality? g. Which node has the highest degree centrality? h. What is the centralization (based on degree) of the graph?

Solution

Find the Answers below:

a) Degree of distribution : Decentralised

Explanation: Degree of distribution is the degree of connectivity between nodes in a graph.
The given graph can be divided into part, so it is called decentralised. If the graph is interconnected it is called centralised.

d) Node with highest degree : E (Degree is 5)
  

Explanation: The degree of a node in a network is the number of connections it has to other nodes.Degree is calculated by number of edges(connecting lines) connected to each node.
From graph we can see that E has more number of edges connected to it.

e) Node with lowest degree : A,F and H (Degree is 1)

Explanation : The degree of a node in a network is the number of connections it has to other nodes.Degree is calculated by number of edges(connecting lines) connected to each node.
From graph we can see that A,F and H has less number of edges connected to it.

f) Highest closeness centrality : E

Explanation :

For example we that node \'B\' to calculate closeness follow below steps

1)count total number of nodes.
2) formula = total nodes/no.of edges to reach other nodes.
Applying above formula for node \'B\' = 8/1+1+1+2+3+2+3 = 8/13 = 0.615
Calculate the above for other nodes as well.
3)Which node has the highest number has highest closeness.

g) Degree centrality : E

Explanation : Degree centrality is determined by \"Number of nodes connected to a node\"

h) Centralization is a node which is connected to maximum nodes.