This question already has an answer here:
- graph theory - clique graph 2 answers
I am reading up about Graph theory and the example it gives for a Clique Subgraph looks like this...
Now it states that the bottom graph is "obviously" the clique graph for the top. Is this because it is the smallest graph that can be made so all vertices are adjacent? Would, for example, a graph with 5 or 6 vertices need to leave some unconnected?
Also it mentions that a Clique is a "Maximal complete subgraph" but I thought subgraphs were supposed to contain the same edges. So why are there only 3 nodes with degrees greater than 2 but in the clique there are 4