Given a graph where each node represents a student and two students are connected by a link if they have ever studied at the same school (not necessarily in the same class or year), which of the following statements is true?
a) A node with clustering coefficient equal to 1 implies that the student never changed schools.
b) A complete graph implies that there is just one school.
c) A student who never changed schools will have clustering coefficient equal to 1.
d) The number of connected components in the graph is necessarily equal to the number of schools.
e) None of the above.
Original idea by: Henrique Campos Padula
No comments:
Post a Comment