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,
(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
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
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
954-M-L-A-L-S (8244).docx
120 KBs Word File
