G&N Unit 7 a

Which one of these measures is useful to assess the quality of the clusters obtained by a community detection algorithm?

• The eigenvector centrality

• The density

• The Page Rank

• The average degree

Given the following graph, which of the proposed subgraphs is NOT a clique

• 
• 
• 
• 

Given the following graph, which of the proposed subgraphs is a MAXIMAL clique

• 
• 
• 
• 

A connected subgraph with nodes having a minimum degree greater or equal to k (all the nodes have at least k neighbors) is called ...

• k-clique

• k-shell

• k-core

• periphery graph of order k

What is a strong community?

• A subgraph where the internal degree of each node is > the external degree of the node

• A subgraph where the total internal degree is > the total external degree

• A subgraph that is a maximal clique

• A subgraph with density > 0.5

In an intermediate state, the min-cut algorithm decides to contract the edge between the nodes 3 and 4. What is the result of this contraction?

• 
• 
• 
•