Graph theory

In this example, in the picture, a container ship traveled across routes between Asia and Europe. This ship visited 11 countries.The countries are the nodes in this picture, and their travel ruts are the links.
    If we start from Singapore(sg) using the BFS algorithm, considering the alphabetical order of the name of nodes, the distances of Italy(it), France(fr), and Turkey(tr) are:
  • I) 5,4,2
  • II) 5,4,3
    Using the algorithm DFS the path from Grece(gr) to Italy(it) is:
  • III) gr-tr-eg-ae-it
  • IV) gr-eg-ae-it
  • V) gr-eg-fr-ae-it
  • A) I,IV
  • B)II,IV.
  • C)I,V
  • D) II,III
  • E) None of the above.

Original idea from: Rolan Alexander Valle Rey Sánchez. imagen modified from: Wang, Z., Claramunt, C., & Wang, Y. (2019). Extracting Global Shipping Networks from Massive Historical Automatic Identification System Sensor Data: A Bottom-Up Approach. Sensors (Basel, Switzerland), 19. http://dx.doi.org/10.3390/s19153363

Comments

  1. Joao MeidanisMarch 25, 2023 at 7:17 AM

    Interesting question, but I cannot take it. When you say, 'alphabetical order of the names of nodes', are you referring to the names inside the circles (e.g., Italy) or the names outside the circles (e.g., it)? Not clear. Also, please end with 'Original idea by: ' and your name.

    ReplyDelete

Post a Comment

Popular posts from this blog

Basic concepts

Image
In this example, in the picture, a container ship traveled across routes between Asia and Europe. This ship visited 11 countries, 19 ports, and 22 terminals. The countries are the nodes in this picture, and their travel ruts are the links. Which country, if its ports were closed by an epidemic, could stop the travel of the container ship to other countries following its travel network? A. Spain, Singapore, or China B. Singapore or China C. China or Grecia D. Greece, Egypt, or the United Arab Emirates E. None of the above. Original idea from: Rolan Alexander Valle Rey Sánchez. imagen from: Wang, Z., Claramunt, C., & Wang, Y. (2019). Extracting Global Shipping Networks from Massive Historical Automatic Identification System Sensor Data: A Bottom-Up Approach. Sensors (Basel, Switzerland), 19. http://dx.doi.org/10.3390/s19153363
Read more

Scale-free networks

Complete the sentences with RN or SFN in the following statements, When we compare random networks (RN) and scale-free networks (SFN). I) In ___, most nodes have the same number of links. II) In ___, many nodes with only a few links. III) In ___, there are A few hubs with a huge number of links. IV) In ___, there are Not highly connected nodes. V) In ___, the size of the largest node grows logarithmically or slower with N, implying that hubs will be tiny even in a very large ___. VI) In__ the size of the hubs grows polynomially with network size; hence they can grow quite large in ___. VII) A ___ follows a Poisson distribution, quite similar to a bell curve. VIII) In __ the distribution, most nodes have only a few links. A few highly connected hubs hold together these numerous small nodes. A) RN: I, II,IV, VI,VII and SFN:III, V, VIII B) RN: II, III,IV, Vand
Read more

Barabási–Albert model

A student is making some simulations about a Barabási–Albert model with different preferential attachment conditions. He is analyzing a particular network model for different scenarios for α=[0, 0.35, 1, 1.6] When the model is in the superlinear attachment, he found that kmax is 20 at the time t0=5. However, when the model is the linear phase at the time 49 kmax is 28 and when the time is 289, kmax=68, find the degree exponent γ He is using. when the model is the sublinear phase at time t0, kmax=2, find kmax at the time 824. γ=2.5 , kmax=18 γ=3 , kmax=19 γ=2.5 , kmax=19 γ=3, kmax=18 None of the above. Original idea by: Alexander Valle Rey
Read more