MathJax


Saturday, November 13, 2021

2021-064

According to the Molloy-Reed criterion, what is the threshold for \( \kappa = \langle k^2 \rangle / \langle k \rangle \) regarding the existence of a giant component in a network with a given degree distribution?

  1. 0
  2. 1
  3. 2
  4. 3
  5. None of the above
Original idea by: Leandro Stival

No comments:

Post a Comment

2025-310

Which of the following alternatives contains a graph with only one Strongly Connected Component (SCC)?  a) b) c)  d)   e) None of the above ...