Question: (a) Prove that two graphs which are isomorphic must contain the same number of triangles.
(b) Prove that, for any n ≥ 4, two isomorphic graphs must contain the same number of n-cycles.
(c) How many edges are there in the graphs G1 and G2? How many vertices? What is the degree sequence of each graph? Are the graphs isomorphic? Explain.
