Professional Documents
Culture Documents
Maximal and Maximum Clique in A Graph
Maximal and Maximum Clique in A Graph
Maximum Clique
in a Graph
Eman Amir BCSM-F20-296
Presented to: Prof. Saleem Mustafa
Clique
1. 1->2->3
2. 3->4->5
Maximal Clique
Def:
A maximal clique is a clique that cannot be extended by including one more
adjacent vertex, meaning it is not a subset of a larger clique.
Applications:
Maximal cliques are important in graph-theoretic applications
1. Including graph coloring
2. Fractional graph coloring
Example
E=Total vertices - 1
• T.V=4 E=4-1=>3
E=Total vertices - 1
• T.V=5 E=5-1=>4
Def:
A maximum clique in a graph G is a clique with as many or more vertices
than any other clique in G. It is a clique such that no other clique in the
graph has more vertices.
Important point
By definition, every maximum clique is maximal, but not every maximal
clique is maximum. We will see an example of a maximal clique that is not
a maximum clique.
Example
1. a->b->c->f (4 vertices)
2. b->c->d (3 vertices)
3. b->e->d (3 vertices)