MathJax


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)

2024-248

  Consider the following networks:   Which of the following options correctly ranks these networks from  most  robust to  least  robust agai...

  • 2023-228
    A company launched a new gadget C to be produced globally for North American and South American markets. The company uses just-in-time as ...
  • 2021-041
    Considering the following network and its partition in green and pink nodes: The modularity \( M \) of a partition can be computed using...
  • 2022-174
    In the Non-linear preferential attachment, the preferential attachment probability becomes \( \Pi(k) \sim k^{\alpha} \). For a starting netw...