7 votes 7 votes A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in a graph shown below? 2 4 5 6 DS ugcnetcse-june2016-paper2 data-structures graph-theory + – go_editor asked Aug 14, 2016 • edited Jan 21, 2023 by makhdoom ghaya go_editor 5.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes Answer must be C) 5 Complete subgraph means each vertex should be connected with all other vretices in the subgraph sh!va answered Aug 16, 2016 • selected Aug 16, 2016 by Prashant. sh!va comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Prateek Thakral commented Oct 16, 2017 reply Follow Share fine... thanks 1 votes 1 votes pujabhakta commented Nov 24, 2018 i edited by pujabhakta Nov 26, 2018 reply Follow Share Why bcf and bef are not count with 2 please ans me 0 votes 0 votes rhl commented Jun 27, 2022 reply Follow Share @pujabhakta bcf and bef was not counted because the question asked for subgraph which is not contained inside any other larger complete subgraph i.e it's asking for maximal clique. Both bcf and bef is contained under bcef. 0 votes 0 votes Please log in or register to add a comment.