Draw a graph that has exactly one maximum clique and exactly one clique that is maximal but not maximum.
Suppose we are applying the pivoting version of the Bron-Kerbosch algorithm to the graph shown below.
Suppose we are using the same graph shown above as a seed graph for the Barabasi-Albert model. What is the probability that the first edge added by the model connects a new vertex to vertex a?
What is the clustering coefficient of the graph shown above?