Let G be a graph. We say that a set of vertices C form a vertex cover if every edge of G is incident to at least one vertex in C. We say that a set of vertices I form an independent set if no edge in G connects two vertices from I. For example, if G is the graph above, C = [b, d, e, f, g, h, j] is a vertex cover since each of the 20 edges in the graph has at least one endpoint in C, and I = [a, c, i, k] is an independent set because none of these edges appear in the graph: ac, ai, ak, ci, ck, ik.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Let G be a graph. We say that a set of vertices C form a vertex cover if every edge of G is
incident to at least one vertex in C. We say that a set of vertices I form an independent set if
no edge in G connects two vertices from I.
For example, if G is the graph above, C = [b, d, e, f, g, h, j] is a vertex cover since each of
the 20 edges in the graph has at least one endpoint in C, and I = [a, c, i, k] is an
independent set because none of these edges appear in the graph: ac, ai, ak, ci, ck, ik.
Transcribed Image Text:Let G be a graph. We say that a set of vertices C form a vertex cover if every edge of G is incident to at least one vertex in C. We say that a set of vertices I form an independent set if no edge in G connects two vertices from I. For example, if G is the graph above, C = [b, d, e, f, g, h, j] is a vertex cover since each of the 20 edges in the graph has at least one endpoint in C, and I = [a, c, i, k] is an independent set because none of these edges appear in the graph: ac, ai, ak, ci, ck, ik.
In the example above, notice that each vertex belongs to the vertex cover C or the independent
set I. Do you think that this is a coincidence?
In the above graph, clearly explain why the maximum size of an independent set is 5. In other
words, carefully explain why there does not exist an independent set with 6 or more vertices.
Transcribed Image Text:In the example above, notice that each vertex belongs to the vertex cover C or the independent set I. Do you think that this is a coincidence? In the above graph, clearly explain why the maximum size of an independent set is 5. In other words, carefully explain why there does not exist an independent set with 6 or more vertices.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 6 images

Blurred answer
Knowledge Booster
Approximation Algorithms
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education