Register

MadeEasy Subject Test: Engineering Mathematics- Graph Connectivity

• recategorized by
553 views

1 Answer

1 votes
1 votes
total no. of vertices = vertex cover+Independent set

25 = 8 + IS

IS = 17
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
Hemant Parihar asked Jan 29, 2018
490 views
MadeEasy Test Series: Graph Theory - Vertex Cover
Vertex cover = Total vertex - Maximum independent set vertex cover = 8 - 3 = 5. In given answer Covering number is given as 4. I think it is given wrong please verify. Thank you.
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...
User Avatar
0 votes
0 votes
0 answers
3
Anusha Motamarri asked Dec 8, 2016
865 views
MadeEasy Test Series: Graph Theory - Graph Connectivity
if m=4 and n=6 (complete graph) option B says removal of mC2-n+2 = 6-6+2=2 edges. but it needs 3 edges to make the graph disconnected. how B is answer?
if m=4and n=6 (complete graph)option B says removal of mC2-n+2 = 6-6+2=2 edges.but it needs 3 edges to make the graph disconnected. how B is answer?
User Avatar
Link Copied!