2023-193

Given the graph in the figure below, evaluate the assertions:

graph Rede {

A -- B [label="10 Gbps"]

A -- C [label="10 Gbps"]

B -- D [label="10 Gbps"]

B -- E [label="100 Mbps"]

E -- C [label="100 Mbps"]

H -- F [label="10 Mbps"]

E -- F [label="100 Mbps"]

F -- G [label="100 Mbps"]

C -- F [label="10 Mbps"]

B -- G [label="10 Mbps"]

D -- H [label="1 Gbps"]

A -- E [label="100 Mbps"]

E -- H [label="1 Gbps"]

}

view raw Rede.gv hosted with ❤ by GitHub

1. There are two paths from router 'A' to router 'H' that are identical in maximum speeds and same path lenght.
2. The average degree of this graph is 3.25.
3. 32.5% of the nodes have a degree of 3.
4. The fastest path between router 'A' and router 'G' has a bandwidth capacity of 100 Mbps.
5. The graph's adjacency matrix is not symmetric.

Choose the alternative listing the true statements:

1. I, IV and V
2. II, and IV
3. II,III and IV
4. III and IV
5. None of above

Original idea by: João Marcos