Sunday, September 4, 2022

2022-153

Given the following oriented graph, which of the statement are true?


I.   Removing any node affects the strong connectivity status (strongly connected or not)

II.  The graph is strongly connected.

III. The length of the shortest path from A to C is 4

IV.  There exist exactly 4 cycles in the graph.




 

 

    A. Only I

    B. II and IV

    C. I and II

    D. only IV

    E. None of the above

Original idea by: Victor Sotelo
at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

2026-368

Consider the following partitions over the same graph: Which alternative lists the partitions in ascending order of modularity ? A) PA, PB...

  • 2022-092
    Read the statements about clustering coefficient below: Local clustering coefficient measures the connectivity of a node to the rest of ...
  • 2023-213
     Considering the following directed graph: I. Since this is a strongly connected graph, it does not have a topological sort. II. We can ea...
  • 2022-182
    Which of the following statements about degree correlations are true: I. In assortative networks, nodes with small degree tend to connect wi...