MathJax


Sunday, August 28, 2022

2022-142

Given the following undirected and unweighted graph:

  What is the length of the shortest path between nodes 1 and 7?

  1. 3
  2. 4
  3. 5
  4. 6
  5. None of the above.

  Original idea by: Pedro Henrique Di Francia Rosso

at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

2026-332

As the average degree \( \langle k \rangle \) of an Erdős-Rényi random network increases, the network's topology undergoes distinct pha...

  • 2021-028
     When a Bianconi-Barabási model reduces to a Barabási-Albert model? When the degree distribution is a normal distribution When the fitnes...
  • 2022-092
    Read the statements about clustering coefficient below: Local clustering coefficient measures the connectivity of a node to the rest of ...
  • 2021-009
    Find the derivative of $$ f(t) = \frac{1}{t} − \frac{1}{2t^3} + \frac{1}{2t^5} $$. \( f'(t) = \dfrac{1}{t} − \dfrac{1}{2t^3} + \dfra...