213 views

1 Answer

Best answer
1 votes
1 votes

given a graph , if we select a subgraph from it such that all vertices in subgraph are adjacent to each other(complete subgraph) then it is called as clique .

selected by

Related questions

0 votes
0 votes
1 answer
1
Anand67222 asked Oct 14, 2023
303 views
How many simple directed (unweighted) graphs on the set of vertices {v0,v1,…v5} are there that have at most one edge between any pair of vertices? (That is, for two ver...
0 votes
0 votes
1 answer
2
gagan55 asked Jun 30, 2023
177 views
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
0 votes
0 votes
2 answers
4
raja11sep asked Jan 5, 2022
464 views
Why is the vertex connectivity of a graph always less than or equal to its edge connectivity?