MathJax


Saturday, November 1, 2025

2025-278

Consider a network with 4 nodes (1, 2, 3, 4) and the following 5 edges: (1, 2), (1, 3), (2, 3), (2, 4), (3, 4). What is the average nearest neighbor degree for nodes of degree \(k=3\), denoted by \(k_{nn}(3)\)?

  1. 2.5
  2. 3.0
  3. 2.67
  4. 2.33
  5. None of the above

Original ideia by: Gabriel Sato

No comments:

Post a Comment

2025-285

The graph below is an input instance for the Traveling Salesperson Problem showing the weight of each link between nodes. Considering that l...