A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph withn nodes is determined. Also, bounds are obtained for the number of different sizes of cliques possible in such a graph.
KeywordsBipartite Graph Complete Graph Preceding Parag Preceding Argument Good Analogue
Unable to display preview. Download preview PDF.