edited by
5,354 views

1 Answer

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

selected by
Answer:

Related questions

3 votes
3 votes
2 answers
1
go_editor asked Aug 14, 2016
5,536 views
The number of different spanning trees in complete graph, $K_4$ and bipartite graph, $K_{2,2}$ have ____ and ___ respectively.14, 1416, 1416, 414, 4
3 votes
3 votes
2 answers
2
go_editor asked Aug 16, 2016
3,731 views
Which of the following is not an inherent application of stack?Implementation of recursionEvaluation of a postfix expressionJob schedulingReverse a string
3 votes
3 votes
3 answers
3
go_editor asked Aug 16, 2016
14,226 views
Suppose you are given a binary tree with n nodes, such that each node has exactly eiter zero or two children. The maximum height of the tree will be$\frac{n}{2}-1$$\frac{...
4 votes
4 votes
1 answer
4