Please visit, subscribe and share 10 Minutes Lectures in Computer Science

# Multiple choices questions in social network analysis, graph theory. Interview questions on social network analysis, quiz questions for social network analysis answers explained, Exam questions in graph theory, find the number of dyadic pairs in an undirected complete graph of N actors

## Social Network Analaysis MCQ - Total number of dyadic pairs in a complete undirected network of N actors

 Next >

1. In an undirected full (complete) network with N actors, the total number of dyadic pairs will be

a) N(N-1)(N-1)/2

b) 2N/N!

c) N!/(N-2)!

d) N(N-1)/2

 Answer: (d) N(N-1)/2   In undirected full networks with N actors, where the direction of relation between a pair is irrelevant ((because if John marries Amy, Amy also marries John), the total number of dyadic pairs will be N(N-1)/2.   Example: the given network is a complete network with 4 nodes (actors). Hence, the total number of dyadic pairs is N(N-1)/2 = 4(3)/2 = 6. The dyadic pairs are (1,2), (1,3), (1,4), (2,3), (2,4), and (3,4).     Dyads - A dyad consists of a pair of actors and the (possible) tie(s) between them. Dyadic pairs, pairs of two actors in a network, are the most important units of analysis in network studies. Dyadic analysis focus on the properties of pair wise relationships, such as whether ties are reciprocated or not, or whether specific types of multiple relationships tend to occur together.   Undirected network – An undirected network is a network in which there is no differentiation between the directions of flows. Undirected network has nodes that do not distinguish between sender and receiver.   Undirected complete network – an undirected network in which every node is adjacent to every other node is a complete network. In other words, every node has unique edge to every other node in that network.

 Next >

************************