Question: If G = (V, E) is an undirected graph, a subset K of V is called a covering of G if for every edge {a,

If G = (V, E) is an undirected graph, a subset K of V is called a covering of G if for every edge {a, b} of G either a or b is in K. The set K is a minimal covering if K - {x} fails to cover G for each x e K. The number of vertices in a smallest covering is called the covering number of G.
(a) Prove that if I c V, then / is an independent set in G if and only if V - I is a covering of G.
(b) Verify that | V | is the sum of the independence number of G (as defined in Exercise 25 for Section 11.5) and its covering number.

Step by Step Solution

3.61 Rating (155 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a Let I be independent and a b E If neither a nor b is in V 1 then a b I and sinc... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

954-M-L-A-L-S (8244).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!