A graph theory question

From: TCL (tlim1_at_cox.net)
Date: 12/09/04 

Date: Wed, 8 Dec 2004 18:05:55 -0600

Let G_1, G_2 be two graphs satisfying the following:
1. They have the same number of vertices.
2. They have the same degree sequences.
3. For every positive integer n>=3, they have the same number of n-cycles.
(A 3-cycle is a triangle)

Must G_1 and G_2 be isomorphic?

Relevant Pages