The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Graph
+3
votes
179
views
graph of 100 edges and 25 vertices..size of minimum vertex cover is 8..what is the size of maximum independence set?
asked
Dec 10, 2016
in
Graph Theory
by
Aboveallplayer
Veteran
(
21.5k
points)

179
views
Facebook
Google+
Twitter
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
+4
votes
Best answer
If C is a vertex cover of a graph, then Remaining vertices form an Independent Set.
Hence, Total number of Vertices = Minimum Vertex Cover + Size of Maximum Independent Set
=> This gives size of Maximum Independent Set = 25  8 = 17
answered
Dec 10, 2016
by
Kapil
Veteran
(
51.6k
points)
selected
Dec 10, 2016
by
ManojK
comment
Please
log in
or
register
to add a comment.
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
0
votes
1
answer
1
Rosen (Graph)
Show that an edge in a simple graph is a cut edge if and only if this edge is not a part of any simple circuit in the graph.
asked
Mar 1
in
Graph Theory
by
Mk Utkarsh
Boss
(
9.5k
points)

45
views
discretemathematics
graphtheory
0
votes
0
answers
2
Graph theory
What is unorderd and ordered (if any) cycles in a given graph?
asked
Feb 16
in
Graph Theory
by
Sidd_
(
163
points)

42
views
+1
vote
1
answer
3
Graph Theory vertex degree
Consider an undirected graph with n vertices, vertex 1 has degree 1, while each vertex 2,3......, n – 1 has degree 4. The degree of vertex n is unknown. Which of the following statement must be TRUE? a. Vertex n has degree 1. b. Graph is connected. c. There is a path from vertex 1 to vertex n. d. Spanning tree will include the edge connecting vertex 1 and n.
asked
Jan 27
in
Graph Theory
by
Tuhin Dutta
Boss
(
7.9k
points)

102
views
discretemathematics
graphtheory
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Believe..!!
Need a Serious Career Advice
Failure... ?
Applying to NUS
THANK U GO !!
All categories
General Aptitude
1.2k
Engineering Mathematics
4.8k
Discrete Mathematics
3.3k
Mathematical Logic
1.3k
Set Theory & Algebra
880
Combinatory
594
Graph Theory
562
Probability
606
Linear Algebra
495
Calculus
360
Digital Logic
2k
Programming & DS
3.5k
Algorithms
3k
Theory of Computation
3.8k
Compiler Design
1.5k
Operating System
2.7k
Databases
2.8k
CO & Architecture
2.5k
Computer Networks
2.9k
Non GATE
941
Others
1.2k
Admissions
334
Exam Queries
410
Tier 1 Placement Questions
17
Job Queries
52
Projects
8
Follow @csegate
Gatecse
Recent Blog Comments
Same is for me. I am getting score 584. 2017 ...
The password for that site is not the same as GO ...
I am not able to log in to GOclassroom. It says ...
congrats hemant :) hope we spend upcoming years ...
Thank you, everyone. All the best to you too. :)
34,234
questions
40,919
answers
116,193
comments
39,834
users