Analyse the graph below and evaluate the following statements: I - The modularity value for this graph is approximately 0.48. II - Removing nodes 15, 6, and 8 is not expected to significantly impact the modularity: it will increase by only about a hundredth compared to the modularity of the original network. III - Introducing a new green node that connects to nodes 3, 5, and 6 increases the modularity to approximately 0.61. IV - Increasing the modularity might cause the green nodes to transition into lilac or orange. Choose an option with only correct statements: a) I, II and III b) II, III and IV c) II and IV d) I, II and IV e) None of above Original idea by: João Marcos
Given the graph in the figure below, evaluate the assertions:
I) There are two paths from router 'A' to router 'H' that are identical in maximum speeds and same path lenght.
II) The average degree of this graph is 3.25.
III) 32.5% of the nodes have a degree of 3.
IV) The fastest path between router A and router G has a bandwidth capacity of 100 Mbps.
V) By constructing the Adjacency Matrix, it would be noticed that it is not symmetric.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 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"] | |
| } |
A) I, IV and V
B) II, and IV
C) II,III and IV
D) III and IV
E ) None of above
Good question. I took it. Don't forget to add "original idea by: " fiolloed by your name ate the end of the question.
ResponderExcluir