Let G and H be graphs, G Han isomorphism. Prove that = deg((v)) 1. for all...

 

Transcribed Image Text:

Let G and H be graphs, G→ Han isomorphism. Prove that = deg(Þ(v)) 1. for all v E VG it holds deg(u) 2. if G is connected, so is H. 3. Let N EN, N≥ 3. The isomorphism maps a cycle of length N in G to a cycle of length N in H. Let G and H be graphs, G→ Han isomorphism. Prove that = deg(Þ(v)) 1. for all v E VG it holds deg(u) 2. if G is connected, so is H. 3. Let N EN, N≥ 3. The isomorphism maps a cycle of length N in G to a cycle of length N in H.