👉 In computer science, a clique is a subset of vertices in a graph that contains all its adjacent vertices. It's also known as an induced subgraph or an induced set. A vertex in a graph is called a neighbor of a vertex if it is connected to that vertex through an edge. If a vertex is not in the clique, then it is said to be an isolated vertex. For instance, consider the following graph: ``` 1 / \ 2
