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
