A clique in a graph is a subgraph where every pair of distinct vertices is adjacent to each other.
Therefore, a subgraph \( H \) of graph \( G \) is called a clique if \( H \) is a complete graph. In a complete graph, every vertex is connected to every other vertex. This is the defining characteristic of a clique.
Therefore, option (4) is correct.
Digital signatures provide ________.
A Session variable is created ________.
The union and intersection of the graphs G and H are respectively 