Professional Documents
Culture Documents
SNA - Question Bank 1
SNA - Question Bank 1
1 4
2 3
15. Give the adjacency matrix and adjacency list representation for the following graph:
Network Measures
17. Define the following with an example:
i) Degree of a node ii) adjacent nodes iii) incident edges iv) walk
v) walk length vi) Trail vii) path viii) cycle ix) distance
x) diameter xi) average path length xii) local clustering coefficient
xiii) global clustering coefficient
18. Problems
All the example problems in Section 2.1.
19. Prove that for an unweighted, undirected network, the sum of the degrees of the nodes
in a graph is twice the number of edges in the graph.
20. Prove that: Sum of the weighted degrees of the nodes in an undirected weighted graph
is twice the sum of weights of the edges in the graph.
21. Prove that: Number of odd-degree nodes in an undirected network is always even.
22. Define node centrality. Compare the different types of centrality measures.
23. Compare degree centrality with closeness centrality. Discuss their significance.
24. Discuss the different types of betweenness centrality measures.
25. Problems on node centrality measures.
26. Short answer questions – Page 67: Qns 1, 4
27. You are a spy inside a terrorist organisation with an extensive knowledge of social
network analysis. State with proper justification which centrality measure you will use
in each of the following situations:
a. To find the person who deals with the most number of people.
b. To find a person who can spread a message faster in the network.
c. To find a person who can spread a message as far as possible in the network.