Académique Documents
Professionnel Documents
Culture Documents
1.
Introduction
(b)
(a)
FIGURE 1
2.
x2,
xn)
is
t n e
number of Kekule* s t r u c t u r e s
xn).
= 0; Fk = F k _ ! + i ^ _ 2 , for k > 0.
For a l l other d e f i n i t i o n s ,
3.
x2> >
xn)
#!(*!) = 1 + *!
We define
(2)
Z 0 = 1.
Kn \X , . . . , Xn- i , Xn)
Xn&n-
]_ \X]_ , . . . , Xn _ ]_ ly
+ Z n _ 2 (x l5
..., ^ n _ 2 - 1).
Proof: Let # be the last kink of L(xi, x2, #n) W e apply the fundamental
theorem for matching polynomials [7].
Let u and V be the vertices belonging only to hexagon (kink) H (Figure 2) .
Consider any perfect matching which contains the bond uv.
The rest of such a
perfect matching will be a perfect matching of the graph consisting of two
components L(xn - 1) and L(xi> x2, . .., xn-\ - 1). The number of such perfect
matchings is
Ki(xn
- 1) Kn_l(x1,
x2,
... ,
xn-\-
i . e . , according to ( 1 ) ,
(4)
xnKn-l(xi,
x2,
. . . , xn_! - 1).
FIGURE 2
On the other hand, each perfect matching without the bond uv must contain
all edges indicated in Figure 3. The rest of such a perfect matching will be a
8
[Feb.
(5)
2> xn-2
" 1)
FIGURE 3
From (4) and (5), we obtain recurrence relation (3).
Obviously, Kn(xi,
(6)
Kn(x\>
...,
x2,
>>>> xn)
xn) = gn +
l <lY <lz
lv^xix
Pn^i*
-"
h-
l
Clearly, g0 = 1.
'?~n
Now, we are going to determine the coefficients gn and gn(l\>
First, we define an auxiliary polynomial
... &p)
(8)
$0 = 1, Qi(xi)
= xi,
Q2(xls
xi)
= 1 - #i +
xYx2.
...,
Xn _ i , X Yi -T L )
Xntyn-
. . . , X ^ _ ]_ )
+ Qn.2(xl9
i.e. ,
(9)
i \X ,
Qn(xl>
\Xn
Xn)
. , Xn-i,
> ^n-2)
i) Hn-1 v*^l . . . J ^ n - 1 /
Let
(10)
Qn(xl>
Clearly:9
SQ
., # n )
= Sn
+
1 <ll
2^
^MV^IJ
<l2< < lp <n
I <p <n
..., ^ p ) ^ ^
^ p
Now, we are going to determine the coefficients (&]_, ..., p) and 5 W , for
n > 1.
First, we prove the following lemmas.
Lemma
1: Sn = (-l)nFn_2.
Proof:
Fi-2,
+ S-k-2>
According to (8),
1 7
5 X - 0 = (-l) * -!.
for i < k.
and by t h e i n d u c t i o n h y p o t h e s i s ,
sk
Lemma
(11)
{-\)k^Fk.h
= -(-D^Ffc-a
= (-l)fc-2(^_3
+ Fk^)
= (-DkFk_2.
2 (a):
Sn(Z1,
...,
A p _l lv)
= (-lf~lvFn_lpSlp_l(ll,
..,,
i p . i ) , f o r p > 1.
(b):
d2)
Sn(ll,
...,
Hp_l9
lp)
= ^^-1CA!, . . . ,
c a s e of
(a) .
The
ip-i)
= (-l)n-nFn_nSn_l(SLl,
. ..,
p_i).
Sn(li,
= -Sn-i(&i,
..., p)
= Sn.1(lli
Sn(li,
..., lp)
Then,
and, by t h e i n d u c t i o n h y p o t h e s i s ,
SUlf
...,
+ ( - l ) " -
" ^ - ! - ^ . ^ * ! ,
2
n i
= {-l) - 'P{Fn_l_lp
^ . ^ ^ . ^ * ! ,
Proof:
...,
ip)
= (-l)n'pFn
_/Ip _
- ( - D ^ V , ^ ^
....
A p _!)
V l
...,
> A p - l ) -
*p_l)
_x . . . ^ - ^ - 1 * ^ - 3 .
snao
p-l>
+ Fn_2.h)Slp_i{ll,
- ( - D " " ^ - ^ . ^ ! ,
Lemma 3: SnUlt
....
f o r p > 1.
that
= (-D""* *'-11(-i)*1"1*V3
- (-l)"-1Fn.4lF,l_3.
For 1 < p < n, according to Lemmas 1 and 2,
S(V
Lemma
4(a):
gn =
Proof:
(b): gnUi,
.... M ' - ^ ' ^ . ^ ^ - t p , - ! ' "
According t o ( 7 ) ,
Sn(#ls
(-l)*!^,
. . . s _! ^ n + 1) = Kh(xl9
V * i - A ~ 3 -
. . . , ^n_15 #)-.-
Hence,
10
[Feb.
(Sn{%i,
(U)
9rndi>
> V
. . . , lv) ,
i f p = n ,
{Sn(ils
. . . , ilp) + n ( 1 ?
. . . , p s n ) , i f ip
< n.
P a r t i c u l a r l y , we have
(15)
gn = Sn + Sn(n)s
f o r n > 1.
Now, from (15), Lemma 1, and Lemma 3, we have
J7n = ( - 1 ) Fn_2 + ( - l ) - l F _ 3 = ( - l ) n ( ^ n _ 2
- F_3) = ( - l ) n F _ 4 ,
and (a) i s p r o v e d .
To prove (b), observe that, for lp = n,
(16)
gnal9
..., A P ) = ^ U i
. . . , P) = 5 n ( l s
. . . , p) + S U i ,
= (-1)* ^ - A p ^ p - A p ^ - x
. . . , p 5 n)
--- ^ 2 - l _ / l _3
+ (-l)n-p-lFn_h_lFip_lp_i_l
= ("Dn
i.e. ,
(17)
gn{lx,
(^n-P ~ ^n-Jlp-P^p-Ap.! -1
..., A p ) = ( - l ) " ~ P V l p - 2 * V V i - l
gnai,
Theorem
... Fj,2_i_1Fl_3
_2 = F-z
l2-ll-lFl1-3>
... ^ . ^ . ^ ^ . 3 .
=
^ 2 - ^ - 1 ^ 1 - 3 -
2: Z n (^ 1 , ..., x n )
1 < x < . . . < ip
<n
1 <p <n
where gn(l\9
Proof:
. . . > &p) i s g i v e n by ( 1 8 ) .
The authors are grateful to I. Gutman for useful discussions and many valuable comments. They are also thankful to the referee for many helpful suggestions .
References
1.
2.
3.
4.
1991]
11
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
JfejL KLUWER
B H ACADEMIC
P ^
PUBLISHERS
[Feb.