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 Sanjay Sharma asked May 11, 2016 edited May 11, 2016 by Pragy Agarwal Sanjay Sharma 824 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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 vijaycs answered May 11, 2016 selected Dec 8, 2017 by sushmita vijaycs comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes B)minimal, minimal srestha answered May 11, 2016 srestha comment Share Follow See all 0 reply Please log in or register to add a comment.