edited by
824 views
0 votes
0 votes
39.

A _________ complete subgraph and a _________ subset of vertices of a graph $G = (V, E)$ are a clique and a vertex cover respectively.

(A) minimal, maximal
(B) minimal, minimal
(C) maximal, maximal
(D) maximal, minimal
edited by

2 Answers

Best answer
2 votes
2 votes

Clique- A clique is a subset of vertices of a graph such that every two distinct vertices are adjacent( Every two vertices adjacent means a complete subgraph).

Minimal Vertex Cover- A minimal vertex cover of a graph is set of minimum vertices such that each edge of the graph is incident to at least one vertex of set.

Ans - Maximal , Minimal

selected by

Related questions

1 votes
1 votes
1 answer
1
Prince Sindhiya asked Nov 19, 2018
450 views
is there any easy way to do this i did it by making equation,Mn+Ec=Vn, Vc+In=Vn
1 votes
1 votes
0 answers
2
Hemant Parihar asked Jan 29, 2018
474 views
Vertex cover = Total vertex - Maximum independent setvertex cover = 8 - 3 = 5.In given answer Covering number is given as 4. I think it is given wrong please verify. Than...
0 votes
0 votes
0 answers
4
Malusi asked Jan 12
88 views
Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex r to u hasw...