networked (by João Marcos)

Considering the topic of Degree Correlations, analyze the assertions below: I) Networks with vertices whose degrees are higher than the structural cutoff will exhibit structural assortativity, as the degree (k_s) becomes smaller than the maximum degree (k_max). II) In a random network, the degree correlation is always positive, indicating a tendency for nodes with high degrees to connect to other nodes with high degrees. III) Adding new nodes that connect hubs to low-degree nodes will never make the graph disassortative. IV) In a scale-free network, the degree correlation is always negative, suggesting a preference for nodes with high degrees to connect to nodes with low degrees. Select the correct one: a) Only IV b) I, II c) I, III d)II, IV e) None of above Original idea by: João Marcos

Taking into consideration the directed graph below and a Strong Connected Components context where the first DFS follows an order of [f,g,h,i,j,k,a,b,c,d,e] if possible, choose the most appropriate alternative: a) This graph has 5 SCCs, the smallest of which is formed by 'k' alone. b) The largest SCC (with the greatest number of nodes) is precisely the first SCC found. c) More than half of the SCCs found have 3 nodes. d) This graph has an even number of SCCs and not all the numbers of nodes in each component are prime numbers. e) None of the above.  Original idea by: João Marcos