Question 1 - Graph Theory

 Given this undirected network, evaluate the following statements:

I. Only nodes A and E have a degree greater than the network’s average degree.

II. The diameter of the network is five.

III. Removing the link between nodes A and E increases the number of components to three.

IV. More than half of the nodes have a clustering coefficient greater than zero.

V. The average clustering coefficient is approximately 0.24.


Which of these are false?


A. I

B. I and III

C. I, II, and III

D. II, III, and IV

E. None of the above


Original idea by: Mylena Roberta

Comentários

  1. Joao Meidanis24 de agosto de 2025 às 11:23

    Cara Mylena, obrigado por sua questão. É interessante, mas temos já a questão 2022-135 que cobre mais ou menos o mesmo terreno.

    ResponderExcluir

Postar um comentário

Postagens mais visitadas deste blog

Question 2 - Random Networks

Consider a random network in the G(N, p) model with N = 10,000 nodes and an average number of links <L> = 9,500. Which of the following values ​​represent, respectively, the peak and width of the degree distribution of this network? A. 2.07 and 1.38 B. 1.90 and 1.38 C. 1.38 and 1.90 D. 1.90 and 1.73 E. None of the above Original idea by: Mylena Roberta
Leia mais

Question 3 - Scale-free Networks

Consider a scale-free network with N = 10⁴ nodes and a degree exponent γ > 2. Based on known scaling regimes for average distance in scale-free networks, estimate the minimum average distance between the nodes. Round the result to two decimal places.  A. 4.15 B. 1.26 C. 9.21 D. 2.22 E. None of the above Original idea by: Mylena Roberta
Leia mais