[algogeeks] Re: polynomial algorithme for isomorphic graphs

2009-07-17 Thread mimouni
On 16 juil, 18:19, Miroslav Balaz wrote: > 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.

[algogeeks] Re: polynomial algorithme for isomorphic graphs

2009-07-17 Thread mimouni
I believe that everything is clear: if I should seek the existence of the isomorphism between two graphs G and H, I should generate the label of each vertex of G and each vertex of H. .. On 16 juil, 18:26, Miroslav Balaz wrote: > And also you should answer the main question , how will you find t

[algogeeks] Re: polynomial algorithme for isomorphic graphs

2009-07-17 Thread mimouni
example of a triangle: A - B A - C B - C here the three vertices A, B and C have the same labeling. On 16 juil, 18:19, Miroslav Balaz wrote: > 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 verti

[algogeeks] Re: polynomial algorithme for isomorphic graphs

2009-07-17 Thread mimouni
example of a triangle: A - B A - C B - C here the three vertices A, B and C have the same labeling. On 16 juil, 18:19, Miroslav Balaz wrote: > 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 verti

[algogeeks] Re: polynomial algorithme for isomorphic graphs

2009-07-17 Thread mimouni
example of a triangle: A-B A-C A-B here it is clear that the vertex A, B and C have identical labeling. On 16 juil, 18:19, Miroslav Balaz wrote: > 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