if a subgraph contains any complete graph of $k_{n}$.then clique is n.
no other subgraph forms greater than this graph.
above graph contains complete graph of $k_{4}$,so clique is 4.
Clique Number. The clique number of a graph , denoted , is the number of vertices in a maximum clique of graph
here it is 4
64.3k questions
77.9k answers
244k comments
80.0k users