# Re: Need Graph Isomorphism Algorithm De-bunked

*From*: Mike Amling <nospam@xxxxxxxxxx>*Date*: 25 Sep 2006 13:30:10 EDT

fgrieu wrote:

I ran the second algorithm[1] on all simply connected graphs of 8

nodes or fewer (with bidirectional edges only and with no edge from

a node to itself, restrictions which make it feasible to go up to

8 nodes).

Nodes Distinct graphs

2 1

3 2

4 6

5 21

6 112

7 853

8 10897 and counting (Give it another 10 or 20 hours.)

So far so good

http://www.research.att.com/~njas/sequences/A001349

It finished counting, and got 11117 for 8 nodes. So much for the easy counterexample.

--Mike Amling

.

**References**:**Need Graph Isomorphism Algorithm De-bunked***From:*Bill Cox

**Re: Need Graph Isomorphism Algorithm De-bunked***From:*Bill Cox

**Re: Need Graph Isomorphism Algorithm De-bunked***From:*Francois Grieu

**Re: Need Graph Isomorphism Algorithm De-bunked***From:*Bill Cox

**Re: Need Graph Isomorphism Algorithm De-bunked***From:*fgrieu

**Re: Need Graph Isomorphism Algorithm De-bunked***From:*Bill Cox

**Re: Need Graph Isomorphism Algorithm De-bunked***From:*Mike Amling

**Re: Need Graph Isomorphism Algorithm De-bunked***From:*fgrieu

- Prev by Date:
**Re: Need Graph Isomorphism Algorithm De-bunked** - Next by Date:
**Re: A question on indistinguishabilty definition** - Previous by thread:
**Re: Need Graph Isomorphism Algorithm De-bunked** - Next by thread:
**Re: Need Graph Isomorphism Algorithm De-bunked** - Index(es):