A clique in an undirected graph $G=\langle V,E\rangle$ is a subset $V'\subseteq…

Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET

Qus

A clique in an undirected graph $G=\langle V,E\rangle$ is a subset $V'\subseteq V$ of vertices, such that

1
2
3
4

A clique in an undirected graph is a subset of vertices in which every pair of distinct vertices is connected by an edge.

That means if we take any two vertices from $V'$, there must be an edge between them.

So, a clique forms a complete subgraph.

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Ask Your Question or Put Your Review.

Please provide more information - at least 10 characters