Graph Theory Question
A group of friends like to relay gossip through messages, the graph below shows how messages usually flow between them. Lucas noticed that messages sent by him were being distorted, and wanted to understand more about their network and who can impact the messages he sends. Consider the following sentences and mark them as true (T) or false (F): Pedro and João have, respectively, a clustering coefficient of 1/3 and 1/6. The average degree in this network is 16/6. The maximum path length in this network is less than 4. Pedro has the highest clustering coefficient. Ana and Davi have the smallest clustering coefficient. The correct option that matches the sentences is: T-T-T-T-F F-T-T-F-T F-T-T-T-F T-F-T-T-F None of the above Original Idea by: Alexandre Petrachini