[algogeeks] Re: polynomial algorithme for isomorphic graphs

2009-07-16 Thread Miroslav Balaz
And also you should answer the main question , how will you find the automorphism function? Or how would you use the theorem only to decide if there exists an isomorphism? 2009/7/16 Miroslav Balaz > I think that there is logical error, in the proof what do you think about > it? > f(A)=B iff A an

[algogeeks] Re: polynomial algorithme for isomorphic graphs

2009-07-16 Thread Miroslav Balaz
I think that there is logical error, in the proof what do you think about it? f(A)=B iff A and B have the same labelig, but what if there are 3 vertices with the same labeling? say A,B,C then F(A)=B and F(A)=C you forget to quantify the f. I think everyone stops reading it if you will have such er