dear sir this is the first part of the demonstration:
http://sites.google.com/site/isomorphismproject/Home/Uned%C3%A9monstrationplusd%C3%A9taill%C3%A9_eng.pdf
On 19 juil, 16:42, Miroslav Balaz wrote:
> No you do not have to explain 1.
> It can be done easily by showing that distance d(a,b) >=d(f
No you do not have to explain 1.
It can be done easily by showing that distance d(a,b) >=d(f(a),f(b)) let
shortest path be a,x_1,x_2,x_3, ... x_k,b then
f(a),f(x_1),f(x_2),f(x_3),...f(x_k),f(b)
is also path,
and d(f(a),f(b))>=d(a,b) by using fact that f has inverse function sice it
is bijection.
dear sir, give me a little time (2 days or 3 days) to give a more
detailed demonstration.
but I must know two things if you enjoy:
1) are that I must show that the distance between A and B equals the
distance between f (A) and f (B)?
2) are that the algorithm is to explain or not?
and thank you
Now it is more clear to me.
So labeling of vertex is set of n fourtuples.
Still i do not understand the proof( first implication trivialy holds,
because such labeling is in variant to permutation)
2) A and B have the same labeling.
If the labeling of A in the pseudo-tree x is nhmb, labeling B in
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.
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
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
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
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
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
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
is aviable in ;http://www.wbabin.net/science/mimouni2e.pdf
On 14 juil, 19:25, Miroslav Balaz wrote:
> Graph isomorphism is not very good problem, because for human generated
> graphs the algorithhm for tree-isomprphism wlll work.
> But that is only my personal opinion.
>
> But it is hard to unde
you can consult in: http://www.wbabin.net/science/mimouni2e.pdf
and I finished on implimentation schedule a php (to find the labels
for a graph exceeds 5000 vertices).
On 14 juil, 19:25, Miroslav Balaz wrote:
> Graph isomorphism is not very good problem, because for human generated
> graphs the
Graph isomorphism is not very good problem, because for human generated
graphs the algorithhm for tree-isomprphism wlll work.
But that is only my personal opinion.
But it is hard to understand your algorithm.
Mainly because i do not understand the words you are using
peak-?
summit-?
pseudo tree-?
14 matches
Mail list logo
