Raphael - MO412 A

Consider a one dimensional lattice with  N  nodes that form a circle, where each node connects to its two neighbors. Partition the line into  n c  consecutive clusters of size  N c =N/n c . According to the Maximum Modularity Hypothesis, the maximum of  M c  corresponds to the best partition. Obtain the community size  n c  corresponding to the best partition when N=15. A)  n c  = 5 B)  n c  = 3.87 C)  n c  = 0.97 D)  n c  = 5.47 E) None of the above Original idea from https://networksciencebook.com/chapter/9#homework9 Author: Raphael Adamski

Solve the Travel Salesperson Problem for the following undirected weighted graph and pick the best answer: A) Path ABCDEA and length 24 B) Path ABCEDA and length 20 C) Path ADEBCA and length 18 D) Path AEBCDA and length 19 E) None of the above Original question by: Raphael Adamski Original images from https://graphicmaths.com/computer-science/graph-theory/travelling-salesman-problem/