MO412 Graph Algorithms Questions

 Which of the following statements are true about degree correlations: I. The tendency for nodes to connect to other nodes with similar properties within a network is a characteristic of an assortative network. II. When we a degree correlation analyse, we can find networks with correlation exponent (μ) and Pearson correlation coefficient (r) with opposite sign. III. For directed networks, positive degree correlation means nodes with high in-degree tend to have high out-degree. IV. The point where the degree distribution decays rapidly is considered structural cutoffs in a network. Select the alternative that lists the correct statements: I, II, III and IV are correct. I, II and IV are correct. II, III, and IV are correct. I and III are correct. None of the above. Original idea by: Germán Darío Buitrago Salazar  

  Based on figure above, we can assert: I. If we apply Kosaraju-Sharir's algorithm, it will return 5 strongly connected components (SCCs), when we assume the node's list are sorted in descending order. II. The component {G, J, I} is not a SCCs because it is inside the component {G, H, K, L, J, I} III. If there is a direct link from node I to node A, we would just have 4 SCCs. IV. If there is a direct link from node D to node C, the SCC {C, F} would still exist. Which statements from the options above are correct ?  A. I, II, III and IV  B. II and IV  C. I, II, IV  D. II and III  E. none of above Original idea by: Germán Darío Buitrago Salazar