d(x,v_j)
> b_ij,is number of vertices x such that d(v_i,x) =1 and d(v_i,v_j)=d(x,v_j)
>
> LABEL(i)=union of all lab(i,j) for each j.
>
> But you have to do some more work on the proof, which can be incorect.
>
> 2009/7/19 mimouni
>
>
>
>
>
> > dear sir, giv
nking about graph isomorphism more than me, so from your
> point of view it can be trivial because you are on higher level.
>
> 2009/7/17 mimouni
>
>
>
>
>
> > On 16 juil, 18:19, Miroslav Balaz wrote:
> > > I think that there is logical error, in the proof wh
get to quantify the f. I think everyone stops reading it if you will
> have such errors there.
>
> 2009/7/15 mimouni
>
>
>
>
>
> > you can consult in:http://www.wbabin.net/science/mimouni2e.pdf
> > and I finished on implimentation schedule a php (to find the l
nd 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 errors there.
>
> > 2009/7/15 mimouni
ere 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 errors there.
>
> 2009/7/15 mimouni
>
>
>
>
>
> > you can consult in:http://www.wba
ere 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 errors there.
>
> 2009/7/15 mimouni
>
>
>
>
>
> > you can consult in:http://www.wba
ere 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 errors there.
>
> 2009/7/15 mimouni
>
>
>
>
>
> > you can consult in:http://www.wba
ster's thesis proofs at least 3
> times each.
>
> 2009/7/14 mimouni
>
>
>
>
>
> > Hello, I found a new labeling vertex, which can make the deference
> > between the peaks of a graph, and thus resolve the automorphism and
> > isomorphism. Its complexity i
have there a lot of errors( i do not mean englis erros)
> You should rework that, i was rewriting my master's thesis proofs at least 3
> times each.
>
> 2009/7/14 mimouni
>
>
>
>
>
> > Hello, I found a new labeling vertex, which can make the deferen
Hello, I found a new labeling vertex, which can make the deference
between the peaks of a graph, and thus resolve the automorphism and
isomorphism. Its complexity is estimated to O (n^3).
And here is the procedure:
To build a pseudo tree this way:
1. Put a single vertices (example: A) in the Level
10 matches
Mail list logo
