30.08.2014 Views

chemia - Studia

chemia - Studia

chemia - Studia

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

MAHDIEH AZARI, ALI IRANMANESH, ABOLFAZL TEHRANIAN<br />

(i) If { e,<br />

f } ∈ A1<br />

, then d<br />

0<br />

( e,<br />

f G1[<br />

G2])<br />

= 1<br />

(ii) If { e,<br />

f } ∈ A2<br />

, then d<br />

0<br />

( e,<br />

f G1[<br />

G2])<br />

= 3<br />

(iii) If { e,<br />

f } ∈ A3<br />

, then d<br />

0<br />

( e,<br />

f G1[<br />

G2])<br />

= 2<br />

(iv) If { e,<br />

f } ∈ A4<br />

, then d<br />

0( e,<br />

f G1[<br />

G2])<br />

= 1+<br />

d(<br />

u1,<br />

v1<br />

G1<br />

) ,<br />

where e = [( u1,<br />

u2<br />

),( u1,<br />

v2<br />

)], f = [( v1,<br />

z2<br />

),( v1,<br />

t2<br />

)]<br />

Proof. (i) Let { e,<br />

f } ∈ A1<br />

and e = [( u1,<br />

u2<br />

),( u1,<br />

v2<br />

)], f = [( u1,<br />

u2<br />

),( u1,<br />

z2<br />

)] .<br />

Due to distance between two vertices in G [ G 1 2]<br />

and by definition of d ( , 0<br />

e f ) , we<br />

have:<br />

d e,<br />

f G [ G ]) = 1+<br />

min{ d((<br />

u , u ),( u , u ) G [ G ]), d((<br />

u , u ),( u , z ) G [ ]),<br />

0( 1 2<br />

1 2 1 2 1 2 1 2 1 2 1<br />

G2<br />

d(( u1 , v2),(<br />

u1,<br />

u2)<br />

G1[<br />

G2]),<br />

d((<br />

u1,<br />

v2),(<br />

u1,<br />

z2)<br />

G1[<br />

G2])}<br />

= 1+<br />

min{0,1,1, d(<br />

v2,<br />

z2<br />

G2)}<br />

= 1+<br />

0 = 1<br />

(ii) Let { e,<br />

f } ∈ A2<br />

and e = [( u1,<br />

u2),(<br />

u1,<br />

v2)],<br />

f = [( u1,<br />

z2),(<br />

u1,<br />

t2)]<br />

.<br />

By definition of the set A<br />

2<br />

, z<br />

2<br />

is adjacent neither to u<br />

2<br />

nor to v<br />

2<br />

in G<br />

2<br />

and this<br />

is also true for t 2<br />

. Therefore,<br />

d e,<br />

f G [ G ]) = 1+<br />

min{ d((<br />

u , u ),( u , z ) G [ G ]), d((<br />

u , u ),( u , t ) G [ ]),<br />

0( 1 2<br />

1 2 1 2 1 2 1 2 1 2 1<br />

G2<br />

d(( u1 , v2<br />

),( u1,<br />

z2<br />

) G1[<br />

G2<br />

]), d((<br />

u1,<br />

v2<br />

),( u1,<br />

t2<br />

) G1[<br />

G2<br />

])} = 1+<br />

min{2,2,2,2} = 3.<br />

(iii) Let { e,<br />

f } ∈ A3<br />

and e = [( u1,<br />

u2<br />

),( u1,<br />

v2<br />

)], f = [( u1,<br />

z2<br />

),( u1,<br />

t2<br />

)]. By<br />

definition of the set A<br />

3<br />

, z2 ∉ { u2<br />

, v2},<br />

t2<br />

∉{<br />

u2<br />

, v2}<br />

.<br />

On the other hand { e,<br />

f } ∉ A2<br />

, so at least one of the following situations occurs:<br />

[ u2 , z<br />

2<br />

] ∈ E(<br />

G2<br />

), [ u2<br />

, t<br />

2<br />

] ∈ E(<br />

G2<br />

), [ v2<br />

, z2<br />

] ∈ E(<br />

G2<br />

) or<br />

v , t ] ∈ E(<br />

) .<br />

[<br />

2 2<br />

G2<br />

This means that, at least one of the distances d (( u1,<br />

u2<br />

),( u1,<br />

z2<br />

) G1[<br />

G2<br />

]),<br />

d (( u1,<br />

u2),(<br />

u1,<br />

t2)<br />

G1[<br />

G2]),<br />

d (( u1,<br />

v2<br />

),( u1,<br />

z2<br />

) G1[<br />

G2<br />

])<br />

or<br />

d (( u1,<br />

v2),(<br />

u1,<br />

t2)<br />

G1[<br />

G2])<br />

is equal to 1. Therefore,<br />

d<br />

0( e,<br />

f G1[<br />

G2])<br />

= 1+<br />

min{ d((<br />

u1,<br />

u2),(<br />

u1,<br />

z2)<br />

G1[<br />

G2]),<br />

d((<br />

u1,<br />

u2),(<br />

u1,<br />

t2)<br />

G1[<br />

G2]),<br />

d (( u1 , v2),(<br />

u1,<br />

z2)<br />

G1[<br />

G2]),<br />

d((<br />

u1,<br />

v2),(<br />

u1,<br />

t2)<br />

G1[<br />

G2])}<br />

= 1+<br />

1 = 2 .<br />

(iv) Let { e,<br />

f } ∈ A4<br />

and e = [( u1,<br />

u2<br />

),( u1,<br />

v2<br />

)], f = [( v1,<br />

z2<br />

),( v1,<br />

t2<br />

)] .<br />

Thus v1 ≠ u1<br />

and<br />

d e,<br />

f G [ G ]) = 1+<br />

min{ d((<br />

u , u ),( v , z ) G [ G ]), d((<br />

u , u ),( v , t ) G [ ]),<br />

0( 1 2<br />

1 2 1 2 1 2 1 2 1 2 1<br />

G2<br />

d (( u1,<br />

v2),(<br />

v1,<br />

z2)<br />

G1[<br />

G2]),<br />

d((<br />

u1,<br />

v2),(<br />

v1,<br />

t2)<br />

G1[<br />

G2])} =<br />

186

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!