Question: Show that if G is a simple graph with n vertices, then the union of G and is Kn.
Step by Step Solution
3.50 Rating (163 Votes )
There are 3 Steps involved in it
Consider the graph G U Its vertex set is clearly the vertex set ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
923-M-C-M-S (2321).docx
120 KBs Word File
