Given two graphs G1 and G2. G1 = Km where m 2 and G2 = Wn where n 3. How many edges are in G1 G2 if G1 and G2 have p (1 p min{m, n}) vertices in common one of which is the hub of the wheel and the rest are consecutive vertices along the wheel's circumference? Hint: To find the number of edges in Km, you may want to consider the Handshake Theorem. Reminder: As defined in this class, Wn has n 1 vertices