International J.Math. Combin. Vol.

1 (2011), 94-106
The Number of Spanning Trees in
Generalized Complete Multipartite Graphs of Fan-Type
Junliang Cai
Laboratory of Mathematics and Complex Systems, School of Mathematical Sciences,
Beijing Normal University, Beijing, 100875, P.R. China
Xiaoli Liu
Elementary Education College, Capital Normal University, Beijing, 100080, P.R.China
E-mail: caijunliang@bnu.edu.cn
Abstract: Let K
k,n
be a complete k-partite graph of order n and let K
F
k,n
be a generalized
complete k-partite graph of order n spanned by the fan set F = {Fn
1
, Fn
2
, , Fn
k
}, where
n = {n1, n2, , n
k
} and n = n1 + n2 + + n
k
for 1 k n. In this paper, we get the
number of spanning trees in K
k,n
to be
t(K
k,n) = n
k2
k

i=1
(n ni)
n
i
1
.
and the number of spanning trees in K
F
k,n
to be
t(K
F
k,n
) = n
2k2
k

i=1

n
i
1
i

n
i
1
i
i i
where i = (di +
_
d
2
i
4)/2 and i = (di
_
d
2
i
4)/2,di = n ni + 3. In particular,
K1,n = K
c
n
with t(K1,n) = 0, Kn,n = Kn with t(Kn,n) = n
n2
which is just the Cayleys
formula and K
F
1,n
= Fn with t(K
F
1,n
) = (
n1

n1
)/

5 where = (3 +

5)/2 and
= (3

5)/2 which is just the formula given by Z.R.Bogdanowicz in 2008.

Key Words: Connected simple graph, k-partite graph, complete graph, tree, Smarandache
(E1, E2)-number of trees.
AMS(2010): 05C10
1. Introduction
Graphs considered here are simple nite and undirected. A graph is simple if it contains neither
multiple edges nor loops. A graph is denoted by G = V (G), E(G) with n vertices and m edges
where V (G) = {v
1
, v
2
, , v
n
} and E(G) = {e
1
, e
2
, , e
m
} denote the sets of its vertices and
1
Sponsored by Priority Discipline of Beijing Normal University.
2
Received December 2, 2010. Accepted February 28, 2011.
The Number of Spanning Trees in GeneralizedComplete Multipartite Graphs 95
edges, respectively. The degree of a vertex v in a graph G is the number of edges incident with
v and is denoted by d(v) = d
G
(v).
For simple graphs G
i
= V
i
(G), E
i
(G) with vertex set V
i
= {v
i1
, v
i2
, , v
ini
}, the empty
graphs of order n
i
are denoted by N
ni
= V
i
, , i = 1, 2, , k. A complete k-partite graph
K
k,n
= K
n1,n2, ,n
k
= V
1
, V
2
, , V
k
, E is said to be one spanned by the empty graph set
N = {N
n1
, N
n2
, , N
n
k
}, denoted by K
N
n1,n2, ,n
k
or K
N
k,n
where n = {n
1
, n
2
, , n
k
}.
In generally, for the graph set G = {G
n1
, G
n2
, , G
n
k
}, the graph
K
G
k,n
= K
N
k,n
G
n1
G
n2
G
n
k
(1)
is said to be a generalized complete k-partite graph spanned by the graph set G.
For all graph theoretic terminology not described here we refer to [1]. Let G be a connected
graph and E
1
, E
2
E(E) with E
1
= E
2
. The Smarandache (E
1
, E
2
)-number t
S
(E
1
, E
2
) of trees
is the number of such spanning trees T in G with E(T)E
1
= but E(T)E
2
= . Particularly,
if E
1
= E(G) and E
2
= , i.e., such number is just the number of labeled spanning trees of a
graph G, denoted by t(G). For a few special families of graphs there exist simple formulas that
make it much easier to calculate and determine the number of corresponding spanning trees.
One of the rst such results is due to Cayley [2] who showed in 1889 that complete graph on n
vertices, K
n
, has n
n2
spanning trees. That is
t(K
n
) = n
n2
for n 2. (2)
Another result is due to Sedlacek [3] who derived in 1970 a formula for the wheel on n +1
vertices, W
n+1
, which is formed from a cycle C
n
on n vertices by adding a new vertex adjacent
to every vertex of C
n
. That is
t(W
n+1
) = (
3 +

5
2
)
n
+ (
3

5
2
)
n
2 for n 3. (3)
Sedlacek [4] also later derived a formula for the number of spanning trees in a M obius
ladder, M
n
, is formed from a cycle C
2n
on 2n vertices ladder v
1
, v
2
, , v
2n
by adding edges
v
i
v
n+i
for every vertex v
i
, where i n. That is
t(M
n
) =
n
2
[(2 +

3)
n
+ (2

3)
n
+ 2] for n 2. (4)
In 1985, Baron et al [5] derived the formula for the number of spanning trees in a square
of cycle, C
2
n
, which is expressed as follows.
t(C
2
n
) = nF

{n}, n 5, (5)
where F

{n} is the n
,
th Fibonacci Number. Similar results can also be found in [6].
The next result is due to Boesch and Bogdanowicz [7] who derived in 1987 a formula for
the prism on 2n vertices, R
n
, which is formed from two disjoint cycles C
n
with vertex set
V (C
n
) = {v
1
, v
2
, , v
n
} and C

n
with vertex set V (C

n
) = {v

1
, v

2
, , v

n
} by adding all edges
of the form v
i
v

i
. That is
t(R
n
) =
n
2
[(2 +

3)
n
+ (2

3)
n
2] for n 3. (6)
96 Junliang Cai and Xiaoli Liu
In 2007, Bleller and Saccoman [8] derived a formula for a threshold graph on n vertices,
T
n
, which is formed from that for all pairs of vertices u and v in T
n
, N(u) v N(v) u
whenever d(u) d(v). That is
t(T
n
) =
k

i=1
d
ni
i
s1

j=k+2
(d
j
+ 1)
nj
(d
k+1
+l)
n
k+1
1
(d
s
+ 1)
ns1
, (7)
where d(T
n
) = (d
(n1)
1
, d
(n2)
2
, , d
(ns)
s
) is the degree sequence of T
n
, d
i
< d
i+1
for i = 1, 2, , s
1, k =
s1
2
and s l(mod 2).
In 2008, Bogdanowicz [9] also derived a formula for an n-fan on n+1 vertices, F
n+1
, which
is formed from a n-path P
n
by adding an additional vertex adjacent to every vertex of P
n
. That
is
t(F
n+1
) =
2
5 3

5
[(
3

5
2
)
n+1
(
3 +

5
2
)
n1
] for n 2. (8)
In this paper it is proved that: Let K
k,n
be a complete k-partite graph of order n where
the vector n = {n
1
, n
2
, , n
k
} and n = n
1
+ n
2
+ +n
k
for 1 k n, then the number of
spanning trees in K
k,n
is
t(K
k,n
) = n
k2
k

i=1
(n n
i
)
ni1
. (9)
Moreover, let K
F
k,n
be a generalized complete k-partite graph of order n spanned by the
fan set F = {F
n1
, F
n2
, , F
n
k
} where n = {n
1
, n
2
, , n
k
} and n = n
1
+ n
2
+ + n
k
for
1 k n, then the number of spanning trees in K
F
k,n
is
t(K
F
k,n
) = n
2k2
k

i=1

ni1
i

ni1
i

i

i
(10)
where
i
= (d
i
+
_
d
2
i
4)/2 and
i
= (d
i

_
d
2
i
4)/2,d
i
= n n
i
+ 3.
In particular, from (9) we can obtain K
1,n
= K
c
n
with t(K
c
n
) = 0 and K
n,n
= K
n
with
t(K
n
) = n
n2
which is just the Cayleys formula (2). From (10) we can also obtain K
F
1,n
= F
n
with t(K
F
1,n
) = (
n1

n1
)/

5 where =
1
2
(3+

5) and =
1
2
(3

5) which is the formula

(8), too.
2. Some Lemmas
In order to calculate the number of spanning trees of G, we rst denote by A(G), or A =
(a
ij
)
nn
, the adjacency matrix of G, which has the rows and columns corresponding to the
vertices, and entries a
ij
= 1 if there is an edge between vertices v
i
and v
j
in V (G), a
ij
= 0
otherwise.
In addition, let D(G) represent the diagonal matrix of the degrees of the vertices of G. We
denote by H(G), or H = (h
ij
)
nn
, the Laplacian matrix (also known as the nodal admittance
matrix ) D(G) A(G) of G. From H(G) = D(G) A(G), we can see that h
ii
= d(v
i
) and
h
ij
= a
ij
if i = j.
The Number of Spanning Trees in GeneralizedComplete Multipartite Graphs 97
A well-known result states the relationship between the number of spanning trees of a
graph and the eigenvalues of its nodal admittance matrix:
Lemma 2.1([10]) The value of t(G), the number of spanning trees of a graph G, is related to
the eigenvalues
1
(G),
2
(G), ,
n
(G) of its nodal admittance matrix H = H(G) as follows:
t(G) =
1
n
n

i=2

i
(G), 0 =
1
(G)
2
(G)
n
(G). (11)
A classic result of Kirchho can be used to determine the number of spanning trees for G.
Next, we state the well-known theorem of Kirchho:
Lemma 2.2(Kirchhos Matrix-Tree Theorem, [11]) All cofactors of H are equal and their
common value is the number of spanning trees.
Lemma 2.3 Let b > 2 be a constant, then the determinant of order m

1 1 1 1
1 b 1 0
.
.
.
0
.
.
.
.
.
.
.
.
. 0
.
.
. 0 1 b 1
0 0 1 b 1

mm
=

m

m

, (12)
where = (b +

b
2
4)/2, = (b

b
2
4)/2.
Proof Let a
m
stand for the determinant in (??) as above, by expending the determinant
according to the rst column we then have
a
m
=

1 1 1 1
1 b 1 0
.
.
.
0
.
.
.
.
.
.
.
.
. 0
.
.
. 0 1 b 1
0 0 1 b 1

mm
= c
m1
+a
m1
, (13)
where
c
m
=

b 1 0 0
1 b 1 0
.
.
.
0
.
.
.
.
.
.
.
.
. 0
.
.
. 0 1 b 1
0 0 1 b 1

mm
= bc
m1
c
m2
(14)
in which c
0
= 1, c
1
= b 1 and c
2
= b
2
b 1.
98 Junliang Cai and Xiaoli Liu
Constructing a function as follows:
f(x) =

m0
c
m
x
m
, (15)
then
f(x) = 1 + (b 1)x +

m2
c
m
x
m
= 1 + (b 1)x +

m2
(bc
m1
c
m2
)x
m
= 1 + (b 1)x +bx(f(x) 1) x
2
f(x),
i.e.
f(x) =
1 x
x
2
bx + 1
=

m0

m+1
+
m
1 +
x
m
(16)
where = (b +

b
2
4)/2 and = (b

b
2
4)/2 which is just the two solutions of the
equation x
2
bx + 1 = 0.
Thus, from (11.4) and (11.5) we have
c
m
=

m+1
+
m
1 +
. (17)
Since
a
3
=

1 1 1
1 b 1
0 1 b 1

= b
2
1 = c
2
+c
1
+c
0
, (18)
from (11.2),(11.6) and (11.7) we can obtain that
a
m
=
m1

k=0
c
k
=
m1

k=0

k+1
+
k
1 +
=

m

m

.
3 Complete Multipartite Graphs
For a complete k-partite graph K
k,n
of order n where the vector n = {n
1
, n
2
, , n
k
} and
n = n
1
+n
2
+ +n
k
for 1 k n with n
1
n
2
n
k
. Let V (K
k,n
) = V
1
V
2
V
k
be the k partitions of the graph K
k,n
such that |V
i
| = n
i
for i = 1, 2, , k. It is clear that for
any vertex v
i
V
i
, d(v
i
) = nn
i
for i = 1, 2, , k. So the degree sequence of vertices in K
k,n
d(K
k,n
) = ((n n
1
)
n1
, (n n
2
)
n2
, , (n n
k
)
n
k
). (19)
Now, let E
i
be an identity matrix of order i, I
ij
= (1)
ij
a total module matrix of order
i j and O
ij
= (0)
ij
a total zero matrix of order i j. Then the diagonal block matrix of
the degrees of the vertices of K
k,n
corresponding to (12) is
D(K
k,n
) = (D
ij
)
kk
, (20)
The Number of Spanning Trees in GeneralizedComplete Multipartite Graphs 99
where D
ii
= (n n
i
)E
ni
and D
ij
= O
ninj
when i = j for 1 i, j k. The adjacency matrix
of K
k,n
corresponding to (??) is
A(K
k,n
) = (A
ij
)
kk
, (21)
where A
ii
= O
ni
and A
ij
= I
ninj
when i = j for 1 i, j k.
Thus, we have from (13) and (14) the Laplacian block matrix (or the nodal admittance
matrix ) of K
k,n
H(K
k,n
) = D(K
k,n
) A(K
k,n
) = (H
ij
)
kk
, (22)
where H
ii
= (n n
i
)E
ni
and H
ij
= I
ninj
when i = j for 1 i, j k.
Theorem 3.1 Let K
k,n
be a complete k-partite graph of order n where the vector n =
{n
1
, n
2
, , n
k
} and n = n
1
+ n
2
+ + n
k
for 1 k n with n
1
n
2
n
k
.
Then the number of spanning trees of K
k,n
is
t(K
k,n
) = n
k2
k

i=1
(n n
i
)
ni1
. (23)
Proof According to Lemma 2.1, we need to determine all eigenvalues of nodal admittance
matrix H(K
k,n
) of K
k,n
. From (15) we can get easily the characteristic polynomial of H(K
k,n
)
as follows:
|H(K
k,n
) E| =

(n n
1
)E
n1
I
n1n2
I
n1n
k
I
n2n1
(n n
2
)E
n2
I
n2n
k

I
n
k
n1
I
n
k
n2
(n n
k
)E
n
k

nn
.
(24)
Since the summations of entries in every column in |H(K
k,n
) E| all are , by adding
the entries of all rows other than the rst row to the rst row in |H(K
k,n
) E|, all entries of
the rst row then become . Thus, the determinant becomes
|H(K
k,n
) E| =

H
+
n1

I
n2n1
(n n
2
)E
n2
I
n2n
k

I
n
k
n1
I
n
k
n2
(n n
k
)E
n
k

nn
,
(25)
where
H
+
n1
=
_
_
1 I
1(n11)
O
(n11)1
(n n
1
)E
(n11)
_
_
n1n1
(26)
100 Junliang Cai and Xiaoli Liu
and the stars * in (18) stand for the matrices with all entries in the rst row being 1. By
adding the entries in the rst row to the rows from row n
1
+ 1 to row n in the determinant
(18), it then becomes
|H(K
k,n
) E| =

H
+
n1

O
n2n1
(n n
2
)E
n2
+I
n2
O
n2n
k

O
n
k
n1
O
n
k
n2
(n n
k
)E
n
k
+I
n
k

nn
,
i.e.
|H(K
k,n
) E| = |H
+
n1
|

1<ik
|(n n
i
)E
ni
+I
ni
|. (27)
From (19) we have
|H
+
n1
| =

1 I
1n1
O
n11
(n n
1
)E
n1

= (n n
1
)
n11
. (28)
For 1 < i k we have
|(n n
i
)E
ni
+I
ni
| =

n (n )I
1(ni1)
I
(ni1)1
(n n
i
)E
ni1
+I
ni1

i.e.
|(n n
i
)E
ni
+I
ni
| = (n )

1 I
1(ni1)
O
(ni1)1
(n n
i
)E
ni1

= (n )(n n
i
)
ni1
.
(29)
By substituting (21),(22) to (20) we have
|H(K
k,n
) E| = (n )
k1
k

i=1
(n n
i
)
ni1
. (30)
So, from (23) we derive all eigenvalues of H(K
k,n
) as follows:
1
= 0 and
_

_
(n
i
1)-multiple roots
i+1
(K
k,n
) = n n
i
, i = 1, 2, , k;
(k 1)-multiple root
n
(K
k,n
) = n.
(31)
By substituting (24) to (11) we have
t(K
k,n
) =
1
n
n

i=2

i
(K
k,n
) = n
k2
k

i=1
(n n
i
)
ni1
. (32)
The Number of Spanning Trees in GeneralizedComplete Multipartite Graphs 101
This is just the theorem.
Corollary 3.2 (Cayleys formula) The total number of spanning trees of complete graph K
n
is
t(K
n
) = n
n2
. (33)
Proof Let k = n, then n
1
= n
2
= = n
n
= 1 and K
n,n
= K
n
. By substituting it to (25)
we then have
t(K
n
) = t(K
n,n
) = n
n2
n

i=1
(n 1)
0
= n
n2
.
3. Generalized Complete Multipartite Graphs
For a generalized complete k-partite graph K
F
k,n
of order n spanned by the fan set F =
{F
n1
, F
n2
, , F
n
k
} where n = n
1
+n
2
+ +n
k
with n
1
n
2
n
k
for 1 k n. It is
clear that the degree sequence of vertices of the fan F
ni
in K
F
k,n
d(F
ni
) = (n n
i
+ 2, (n n
i
+ 3)
ni3
, n n
i
+ 2, n 1) (34)
for i = 1, 2, , k. So the degree sequence of vertices of K
F
k,n
is
d(K
F
k,n
) = (d(F
n1
), d(F
n2
), , d(F
n
k
)). (35)
Now, the diagonal block matrix of the degrees of the vertices of K
F
k,n
corresponding to (28)
is
D(K
F
k,n
) = (D
ij
)
kk
, (36)
where from (27) we have
D
ii
= diag{n n
i
+ 2, n n
i
+ 3, , n n
i
+ 3, n n
i
+ 2, n 1} (37)
and D
ij
= O
ninj
when i = j for 1 i, j k.
The adjacency matrix of K
F
k,n
corresponding to (28) is
A(K
F
k,n
) = (A
ij
)
kk
, (38)
where
A
ii
=
_
_
_
_
_
_
_
_
_
_
_
_
0 1 1
1 0
.
.
. 1
.
.
.
.
.
.
.
.
.
.
.
.
.
.
. 0 1
1 1 1 0
_
_
_
_
_
_
_
_
_
_
_
_
nini
(39)
and A
ij
= I
ninj
when i = j for 1 i, j k.
102 Junliang Cai and Xiaoli Liu
Thus, we have from (29) (32) the Laplacian block matrix (or the nodal admittance
matrix ) of K
F
k,n
H(K
F
k,n
) = D(K
F
k,n
) A(K
F
k,n
) = (H
ij
)
kk
, (40)
where
H
ii
= D
ii
A
ii
=
_
_
_
_
_
_
_
_
_
_
_
_
_
d
i
1 1 1
1 d
i
1 1
.
.
.
.
.
.
.
.
.
.
.
.
1 d
i
1
1 d
i
1 1
1 1 1 n 1
_
_
_
_
_
_
_
_
_
_
_
_
_
nini
(41)
with d
i
= n n
i
+ 3 and H
ij
= I
ninj
when i = j for 1 i, j k.
Theorem 4.1 Let K
F
k,n
be a generalized complete k-partite graph of order n spanned by the
fan set F = {F
n1
, F
n2
, , F
n
k
} where n = {n
1
, n
2
, , n
k
} and n = n
1
+ n
2
+ + n
k
for
1 k n, then the number of spanning trees in K
F
k,n
is
t(K
F
k,n
) = n
2k2
k

i=1

ni1
i

ni1
i

i

i
(42)
where
i
= (d
i
+
_
d
2
i
4)/2 and
i
= (d
i

_
d
2
i
4)/2,d
i
= n n
i
+ 3.
Proof According to the Kirchhos Matrix-Tree theorem, all cofactors of H(K
F
k,n
) are
equal to the number of spanning trees t(K
F
k,n
). Let H

(K
F
k,n
) be the cofactor of H(K
F
k,n
)
corresponding to the entry h
nn
of H(K
F
k,n
), then
t(K
F
k,n
) = |H

(K
F
k,n
)| =

H
11
I
n1ni
I
n1(n
k
1)

I
nin1
H
ii
I
ni(n
k
1)

I
(n
k
1)n1
I
(n
k
1)ni
H

kk

(43)
The Number of Spanning Trees in GeneralizedComplete Multipartite Graphs 103
where
H

kk
=
_
_
_
_
_
_
_
_
_
_
_
d
k
1 1
1 d
k
1
.
.
.
.
.
.
.
.
.
1 d
k
1
1 d
k
1
_
_
_
_
_
_
_
_
_
_
_
(n
k
1)(n
k
1)
. (44)
Since the summations of entries in every column in |H

(K
F
k,n
)| all are 1 by adding the
entries of all rows other than the rst row to the rst row in |H

(K
F
k,n
)| the entries of the rst
row become 1. By adding the entries in the rst row to the rows from row n
1
+1 to row n 1
in the last determinant, it becomes from (36) and (37)
|H

(K
F
k,n
)| =

n1


O
nin1
H
ii
+I
ni


O
(n
k
1)n1
O
(n
k
1)ni
H

n
k
1

,
i.e.
t(K
F
k,n
) = |H

(K
F
k,n
)| = |H

n1
|

1<i<k
|H
ii
+I
ni
| |H

n
k
1
|, (45)
where
|H

n1
| =

1 1 1 1 1
1 d
1
1 1
.
.
.
.
.
.
.
.
.
.
.
.
1 d
1
1 1
1 d
1
1 1
1 1 1 1 n 1

n1n1
,
by adding the entries in the rst row to the correspondence entries of the other row in |H

n1
|
we then have
|H

n1
| =

1 1 1 1 1
0 d
1
+ 1 0 1
.
.
. 0
1
.
.
.
.
.
.
.
.
. 1
.
.
.
.
.
. 1 0 d
1
+ 1 0 0
1 1 0 d
1
0
0 0 0 0 n

n1n1
,
104 Junliang Cai and Xiaoli Liu
i.e.
|H

n1
| = n

1 1 1 1
0 d
1
+ 1 0 1
.
.
.
1
.
.
.
.
.
.
.
.
. 1
.
.
. 1 0 d
1
+ 1 0
1 1 0 d
1

(n11)(n11)
; (46)
It is clear that
|H
ii
+I
ni
| =

d
i
0 1 1 0
0 d
i
+ 1 0 1
.
.
.
1
.
.
.
.
.
.
.
.
. 1
.
.
.
.
.
. 1 0 d
i
+ 1 0
1 1 0 d
i
0
0 0 n

nini
,
i.e.
|H
ii
+I
ni
| = n

d
i
0 1 1
0 d
i
+ 1 0 1
.
.
.
1
.
.
.
.
.
.
.
.
. 1
.
.
. 1 0 d
i
+ 1 0
1 1 0 d
i

(ni1)(ni1)
.
Since the summations of all entries in every column in the last determinant, we have
|H
ii
+I
ni
| = n
2

1 1 1 1
0 d
i
+ 1 0 1
.
.
.
1
.
.
.
.
.
.
.
.
. 1
.
.
. 1 0 d
i
+ 1 0
1 1 0 d
i

(ni1)(ni1)
; (47)
and
|H

n
k
1
| =

d
k
0 1 1
0 d
k
+ 1 0 1
.
.
.
1
.
.
.
.
.
.
.
.
. 1
.
.
. 1 0 d
k
+ 1 0
1 1 0 d
k

(n
k
1)(n
k
1)
,
Similarly, we have
The Number of Spanning Trees in GeneralizedComplete Multipartite Graphs 105
|H

n
k
1
| = n

1 1 1 1
0 d
k
+ 1 0 1
.
.
.
1
.
.
.
.
.
.
.
.
. 1
.
.
. 1 0 d
k
+ 1 0
1 1 0 d
k

(n
k
1)(n
k
1)
. (48)
By substituting (39),(40) and (41) to (38), it becomes
t(K
F
k,n
) = n
2k2

1ik

1 1 1 1
0 d
i
+ 1 0 1
.
.
.
1
.
.
.
.
.
.
.
.
. 1
.
.
. 1 0 d
i
+ 1 0
1 1 0 d
i

(ni1)(ni1)
,
or
t(K
F
k,n
) = n
2k2

1ik

1 1 1 1
1 d
i
1 0
.
.
.
0
.
.
.
.
.
.
.
.
. 0
.
.
. 0 1 d
i
1
0 0 1 d
i
1

(ni1)(ni1)
. (49)
Thus, from (11.1) and (42) we have
t(K
F
k,n
) = n
2k2

1ik

ni1
i

ni1
i

i

i
(50)
where
i
= (d
i
+
_
d
2
i
4)/2,
i
= (d
i

_
d
2
i
4)/2 and d
i
= n n
i
+ 3.
This is just the theorem.
Corollary 4.2 The total number of spanning trees of a fan graph F
n
is
t(F
n
) =
1

5
(
n1

n1
) (51)
where = (3 +

5)/2 and = (3

5)/2.
Proof Let k = 1, then n
1
= n and K
F
1,n
= F
n
. Substituting this fact into (35), this result
is followed.
106 Junliang Cai and Xiaoli Liu
References
[1] J.A.Bondy and U.S.R.Murty, Graph Theory with Applications. The Macmilan Press LTD,1976.
[2] G.A.Cayley, A Theorem on Trees. Quart. J. Math.,23,(1889),276-387.
[3] J.Sedlacek, Lucas Numbers in Graphs Theory. In: Mqthematics(Geometry and Graph
Theory)(Chech.). Univ.Karlova, Prague, (1970),111-115.
[4] J.Sedlacek, On the Skeleton of a graph or Digraph. In: Combinatorial Structures and
Their Applications(R.Guy,M.Hanani,N.Saver and J.Schonheim,eds.),Gordon and Breach,
New york(1970),387-391.
[5] G.Baron,F.Boesch,H.Prodinger,R.Tichy and J,Wang, The Number of spanning trees in the
Square of Cycle. The Fibonacci Quart., 23,(1985),258-264.
[6] G.J.F.Wang and C.S.Yang, On the Number of Spanning Trees of Circulant Graphs. Inter.
J. Comput.Math.,16,(1984),229-241.
[7] G.F.T.Boesch and Z.R.Bogdanowicz, The Number of Spanning Trees in a Prism. Inter. J.
Comput.Math.,21,(1987),229-243.
[8] S.K.Blelleer and J.T.Saccoman, A Correction in the Formula for the Number of Spanning
Trees in threshold graphs. Australasian of Combinatorics,37,(2007),205-213.
[9] Z.R.Bogdanowicz, Formulas for the Number of Spanning Trees in a Fan. Applied Mathe-
matical Sciences,2,(2008),781-786.
[10] V.M.Chelnokov and A.K.Kelmans, A Certain Polynomial of a Graph and Graphs with an
Extremal Number of Trees. J. Combin. Theory, Ser. B, 16,(1974),197-214.
[11] G.G.Kirhho,

Uber die Auosung der Gleichungen, auf welche man bei der Untersuchung
der linearen Verteilung galvanischer Strme gefhrt wird. Ann Phys. Chem., 72,(1847),497-
508.