Consider two networks, G1G_1 and G2G_2, both modeled according to the Erdős–Rényi model G(N,p)G(N,p). Both networks have N=1000N = 1000, but different connectivity parameters given by:

  • p1=0.012p_1 = 0.012
  • p2=0.004p_2 = 0.004

Based on the presented parameters and the robustness concepts studied in class, choose the correct alternative.

a) G2 has greater structural robustness because it presents lower average connectivity. 

b) G1​ has lower connectivity and, therefore, lower failure propagation. 

c) G1 presents a higher critical threshold fc being more robust against random vertex removal, but more susceptible to rapid failure propagation. 

d) G2 ​presents greater cascading failure propagation due to its lower average degree. 

e) None of the above.

Original idea by: Tássia Martins

Comments

  1. Joao MeidanisMay 16, 2026 at 7:00 AM

    I'm afraid I cannot accept this question, as we didn't study connectivity or average connectivity.

    ReplyDelete

Post a Comment

Popular posts from this blog

Image
  Look at the figures below and choose the right answer: I- The graph in figure A is a Multigraph and in figure B is a simple graph. II- In a complete graph, known as clique, all nodes are connected to each other. III- The diameter of the graph in figure B is d max = 4. IV- The adjacency matrix of graph in figure B is: a) I and II are correct b) II, III and IV are correct c) II and IV are correct d) I, II, IV are correct e) None of the above
Read more
Look at the adjacency matrix of a directed graph below, analyze the statements, and choose the right answer: $$ A_{ij} = \begin{pmatrix} 0 & 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 \\  0 & 0 & 0 & 0 & 1 & 0 & 0 \\ 1 & 0 & 0 & 0 & 0 & 0 & 0 \\ 1 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 \end{pmatrix} $$ OBS: To BFS and DFS consider starting at node 1 and in an ascending order. I - This graph has a Cycle, so we can say that there is at least one back edge. II - The order that the nodes are visited using DFS is 1-4-2-6-7-5-3. III - The order that the nodes are visited using BFS is 1-4-5-2-6-7-3. IV - Besides the graph presented by the matrix being a directed graph, in an undirected graph there are no forward and no cross edges. a) I, II, III and IV are co...
Read more
C onsider a directed graph G and the concept of Strongly Connected Components (SCC). Analyze the following statements, and choose the right answer: I- In a directed tree, each vertex is considered a SCC. II- Every cycle in a directed graph G always constitutes its own separate SCC. III- A trivial graph G cannot be considered as a SCC. a) I and II are correct. b) II and III are correct.  c) Only I is correct.  d) Only III is correct. e) None of the above. Original idea by: Tássia Martins
Read more