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.

COMPUTATION OF THE FIRST EDGE WIENER INDEX OF A COMPOSITION OF GRAPHS<br />

E1 = {[( u1,<br />

u2),(<br />

u1,<br />

v2)]<br />

∈ E(<br />

G1[<br />

G2]) : u1<br />

∈V<br />

( G1<br />

), [ u2,<br />

v2]<br />

∈ E(<br />

G2)}<br />

E2 = {[( u1,<br />

u2),(<br />

v1,<br />

v2)]<br />

∈ E(<br />

G1[<br />

G2]) :[ u1,<br />

v1<br />

] ∈ E(<br />

G1<br />

), u2,<br />

v2<br />

∈V<br />

( G2)}<br />

By definition of the composition, E U E = E G [ ]) and obviously,<br />

E I = φ , E = V G ) E(<br />

) and E = V G ) E(<br />

) .<br />

1<br />

E 2<br />

1 2<br />

(<br />

1<br />

G2<br />

2<br />

1<br />

(<br />

1<br />

G2<br />

2<br />

(<br />

2<br />

G1<br />

Set:<br />

A = {{ e,<br />

f } ⊆ E(<br />

G1[<br />

G2]) : e ≠ f , e,<br />

f ∈ E1}<br />

B = {{ e,<br />

f } ⊆ E(<br />

G1[<br />

G2]) : e ≠ f , e,<br />

f ∈ E2}<br />

C = {{ e,<br />

f } ⊆ E(<br />

G1[<br />

G2]) : e∈<br />

E1,<br />

f ∈ E2}<br />

It is easy to see that each pair of the above sets is disjoint and the<br />

union of them is the set of all two element subsets of E G 1[<br />

G ]) . Also we have:<br />

E<br />

⎛<br />

1 ⎛ V ( G<br />

⎞<br />

1)<br />

E(<br />

G2<br />

) ⎞<br />

A = = ⎜ ⎟<br />

⎜<br />

⎟<br />

,<br />

⎝ 2 ⎠<br />

2<br />

⎝ ⎠<br />

2<br />

E<br />

⎛<br />

2 ⎛ V ( G<br />

⎞<br />

2 ) E(<br />

G1<br />

) ⎞<br />

B = = ⎜ ⎟<br />

⎜<br />

⎟<br />

,<br />

⎝ 2 ⎠<br />

2<br />

⎝ ⎠<br />

(<br />

2<br />

C = E1 E2<br />

= V ( G1<br />

) V ( G2<br />

) E(<br />

G1<br />

) E(<br />

G2<br />

)<br />

2<br />

Consider four subsets A<br />

1<br />

, A2<br />

, A3<br />

and A<br />

4<br />

of the set A as follows:<br />

A1 = {{ e,<br />

f } ∈ A : e = [( u1,<br />

u2),(<br />

u1,<br />

v2)],<br />

f = [( u1,<br />

u2),(<br />

u1,<br />

z2)],<br />

u1<br />

∈V<br />

( G1<br />

),<br />

u v , z ∈ V ( )}<br />

A<br />

2, 2 2<br />

G2<br />

= {{ e,<br />

f } ∈ A : e = [( u1,<br />

u2),(<br />

u1,<br />

v2)],<br />

f = [( u1,<br />

z2),(<br />

u1,<br />

t2)],<br />

u1<br />

∈V<br />

(<br />

1),<br />

u , v , z , t ∈V ( G ), both z and t are adjacent neither<br />

2<br />

G<br />

2 2 2 2 2 2 2<br />

to u nor to v in G }<br />

2 2 2<br />

A3 = {{ e,<br />

f } ∈ A : e = [( u1,<br />

u2),(<br />

u1,<br />

v2)],<br />

f = [( u1,<br />

z2),(<br />

u1,<br />

t2)],<br />

u1<br />

∈V<br />

( G1<br />

),<br />

u2 , v2<br />

∈ V ( G2),<br />

z2,<br />

t2<br />

∈V<br />

( G2)<br />

−{<br />

u2,<br />

v2}}<br />

− A2<br />

A4 = {{ e,<br />

f } ∈ A : e = [( u1,<br />

u2),(<br />

u1,<br />

v2)],<br />

f = [( v1,<br />

z2),(<br />

v1,<br />

t2)],<br />

u1,<br />

v1<br />

∈V<br />

( G1<br />

),<br />

v ≠ u u , v , z , t ∈V<br />

( )}<br />

1 1, 2 2 2 2<br />

G2<br />

It is clear that, every pair of the above sets is disjoint and U 4 A = A i<br />

.<br />

i=<br />

1<br />

In the next Proposition, we characterize d e,<br />

f G [ ]) for all { e,<br />

f } ∈ A .<br />

Proposition 1. Let { e,<br />

f } ∈ A .<br />

0( 1<br />

G2<br />

185

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

Saved successfully!

Ooh no, something went wrong!