538
Views
1
CrossRef citations to date
0
Altmetric
Original articles

Complexity of Join and Corona graphs and Chebyshev polynomials

ORCID Icon
Pages 557-572 | Received 12 May 2018, Accepted 16 Jul 2018, Published online: 02 Aug 2018

ABSTRACT

Boesh and Prodinger have shown how to use properties of Chebyshev polynomials to compute formulas for the number of spanning trees of some special graphs. In this paper, we extend this idea for some operations on graphs such as, Join and Corona of two graphs G1 and G2, if G1 and G2 are one of the following graphs: (i) Path graph Pn, (ii) Cycle graph Cn, (iii) Complete graph Kn, (iv) Complete bipartite Km,n, (v) Hypercube graph Qn, (vi) Fan graph Fn and (vi) Wheel graph Wn.

Mathematics subject classifications:

1. Introduction

The study of the number of spanning trees in a graph has a long history and has been very active because computing this number is important: (1) in analysing energy of masers in investigating the possible particle transitions; (2) in estimating the reliability of a network; (3) in designing electrical circuits; (4) in enumerating certain chemical isomers; (5) in counting the number of Eulerian circuits in a graph [Citation1–10].

The number of spanning trees τ(G) of a finite undirected graph G is equal to the total number of distinct spanning subgraphs of G that are trees. This quantity is also known as the complexity of G. There exist various methods of finding this number. Let us recall the famous Matrix tree theorem of Kichhoff [Citation11]: The complexity τ(G) of a graph G is equal any cofactor of Laplace matrix L(G)=D(G)A(G), where D(G)=diag(d(u),uV) is the diagonal matrix of vertex degrees of G and A(G) is the adjacency matrix of G.

Another way to compute the number of spanning trees a graph, is to recursively degenerate the graph by deleting and contracting edges. In this way, the number of spanning trees of an unknown graph G is reduced to a sum of the number of spanning trees in small graphs which is well known. Let ebe an edge with endpoints u and vin the graph G, the contraction Ge of e from G is the graph obtained by removing e and identifying u and v. The deletion Ge of e from G is the graph obtained by removing e. The formula for counting spanning trees in a graph G is τ(G)=τ(Ge)+τ(Ge) (see [Citation12,Citation13]).

Another way to compute the number of spanning trees in a graph is using linear algebra. Let G(V,E) be a graph with vertex set is V={v1,v2,,vn} with non-increasing degree sequence d1d2dn, where di is the degree of vertex vi for i=1,2,,n. The eigenvalues of L(G) are called the Laplacian eigenvalues (Spectrum) and denoted by λ1λ2λn=0. It is well known that λ1=n.

The following formula in terms of Laplacian eigenvalues of G is well known by Kelmans and Chelnoknov [Citation14] as: (1) τ(G)=1ni=1n1λi.(1) By S(G), we denote the Laplacian spectrum of G. For a graph G of order n, we write S(G)=(λ1,,λn) with the understanding that λ1λ2λn.

2. Some properties of Chebyshev polynomial

In this section, we introduce some relations concerning Chebyshev polynomials of the first and second kind which we use in our computations [Citation15].

The Chebyshev polynomials of the first kind are defined by: (2) Tn(x)=cos(narccosx).(2)

It is easily verified that (3) Tn+1(x)=2xTn(x)Tn1(x);T0(x)=1,T1(x)=x.(3)

Furthermore by using standard methods for solving the recursion (3), one obtains the explicit formula: (4) Tn(x)=12x+x21n+xx21n.(4)

The Chebyshev polynomials of the second kind are defined by: (5) Un(x)=1n+1ddxTn+1(x)=sin((n+1)arccosx)sin(arccosx).(5)

It is easily verified that (6) Un+1(x)=2xUn(x)Un1(x);U0(x)=1,U1(x)=2x.(6)

Furthermore by using standard methods for solving the recursion (6), one obtains the explicit formula: (7) Un(x)=12x21x+x21n+1xx21n+1,n1.(7)

We have, Un1cosiπn=0,i=1,2,,n1. Hence (8) Un1(x)=2n1i=1n1xcosiπn.(8)

One further notes that: (9) Un1(x)=(1)n1Un1(x)=2n1i=1n1x+cosiπn.(9)

These two results yield another formula for Un(x), (10) Un12(x)=4n1j=1n1x2cos2jπn.(10)

Simple manipulation of the above formula yields the following, which also will be extremely useful to us latter: (11) Un12x+24=j=1n1x2cos2jπn.(11)

One further notes that: (12) i=1n122cosiπn=n,n2,(12) (13) i=1n122cos2iπn=n2,n2.(13) Polynomials Tn(x) and Un1(x) are related by the following identity (14) Un12(x)=12(x21)[Tn(2x21)1].(14) Fibonacci numbers, Fn.are defined by recursive relation (15) Fn=Fn1+Fn2,n2.(15) With initial conditions F0=0 and F1=F2=1 [Citation16].

An interesting fact follows by comparing (7) with the well known closed form formula for the Fibonacci numbers Fn. (16) Fn=151+52n152n,(16) namely, (17) Un132=F2n=153+52n352n.(17)

The Lucas numbers, Ln are defined by recursive relation (18) Ln=Ln1+Ln2,n2,(18) with initial conditions L0=2,L1=1 and L2=3 [Citation17].

Also we can prove that: (19) 2Tn32=L2n=3+52n+352n.(19)

3. Complexity of the join of two graphs

The join of two graphs G1 and G2 is the graph G1G2=(G¯1+G2¯¯). This is the union of two graphs G1 and G2, with every vertex in G1 connected to every vertex in G2. We note that G1G2 is always connected [Citation18].

Theorem 3.1:

Let G1 and G2 be graphs on disjoint sets of n1 and n2 vertices respectively. If S(G1)=(λ1,,λn1) and S(G2)=(σ1,,σn2) are the eigenvalues of L(G1) and L(G2) arranged in non-increasing order, then the eigenvalues of L(G1G2) are n1+n2;λ1+n2,,λn11+n2;σ1+n1,,σn21+n1 and 0.

Proof

The adjacency matrix of G1G2 can be defined as: A(G1G2)=A(G1)Jn1n2Jn2n1A(G2)

Let 1n be all one column vector of length n, the degree sequence of G1G2, d(G1G2)=A(G1G2)1|V(G1G2)|=A(G1)Jn1n2Jn2n1A(G2)11=d1(G1)+n2dn1(G1)+n2d1(G2)+n1dn2(G2)+n1

Thus the degree matrix of G1G2 can be defined as D(G1G2)=D(G1)+n2In100D(G2)+n1In2 and hence the Laplacian matrix of G1G2 is L(G1G2)=L(G1)+n2In1Jn1n2Jn2n1L(G2)+n1In2.

From this we may readily deduce the Laplacian spectrum of G1G2 by exhibiting a complete set of eigenvectors. If w is an eigenvector of L(G1) corresponding to λi, 1in11, then the vector xk=wk, 1kn1 and xk=0 otherwise, can be seen to be an eigenvector of L(G1G2) with eigenvalue λi+n2.

Similarly, we obtain the eigenvalue σj+n1 for 1jn21. The all ones vector gives as usual, the eigenvalue 0, and the eigenvector whose value is n1 on the vertices of G1 and n2 on the vertices of G2 gives the eigenvalue n1+n2.

Lemma 3.1:

Let L(Fn) be the Laplacian matrix of the fan graph Fn=K1Pn,n2. Then its eigenvalues are 0,n+1,32cosiπn,(1in1).

Proof

The Laplacian matrix of the fan graph Fn can be defined as: L(Fn)=nλ1112λ10013λ003λ110012λ,

Straightforward induction using properties of determinants, we have det(L(Fn))=λ+nλλ2λ1det2λ10013λ003λ10012λ.

Applying Lemma 3.1 by the author in [Citation19], we get: det(L(Fn))=λ+nλλ2λ1(2λ1)Un11+2λ2.

Using identity (8), we have: det(L(Fn))=λ(λn1)k=1n13λcoskπn,

Therefore, det(L(Fn))=0 implies, λ=0,λ=n+1,λ=32cosiπn,1in1.

Lemma 3.2

Let L(wn) be the Laplacian matrix of the wheel graph Wn=K1Cn,n2. Then its eigenvalues are 0,n1,32cos2jπn,(1jn1).

Proof

The Laplacian matrix of the wheel graph Wn can be defined as: L(Wn)=nλ1113λ100113λ00003λ1110013λ.

Straightforward induction using properties of determinants, we get det(L(Wn))=λ+nλλ2λ1det3λ100113λ00003λ110013λ.

Applying Lemma 3.2 by the author in [Citation20] together with Equation (14), we get: det(L(Wn))=2(λ+nλλ2)λ1Tn3λ21=λ+nλλ2λ1(1λ)Un125λ4=λ(λn1)k=1n13λ2cos2kπn.

Thus, det(L(Wn))=0, implies, λ=0,λ=n+1,λ=32cos2jπn,(1jn1).

Now we can introduce the following theorem:

Theorem 3.2

Let G1 and G2 be graphs on disjoint sets of n1 and n2 vertices respectively. If S(G1)=(λ1,,λn1) and S(G2)=(σ1,,σn2) are the eigenvalues of L(G1) and L(G2), then τ(G1G2)=i=1n11(λi+n2)j=1n21(σj+n1).

Theorem 3.5

For m,n,r and s1, we have

  1. τ(PmPn)=12m+n((n+2)24)((m+2)24)×n+2+(n+2)24mn+2(n+2)24m××m+2+(m+2)24nm+2(m+2)24n.

  2. τ(PmCn)=n2m+n×m(n+2)24×n+2+(n+2)24mn+2(n+2)24m××m+2+(m+2)24n+m+2(m+2)24n2n+1.

  3. τ(CmCn)=12m+n×mn×m+2+(m+2)24n+m+2(m+2)24n2n+1×n+2+(n+2)24m+n+2(n+2)24m2m+1.

  4. τ(KmPn)=(m+n)m12n(m+2)24×m+2+(m+2)24nm+2(m+2)24n.

  5. τ(KmCn)=(m+n)m1m×2n×m+2+(m+2)24n+m+2(m+2)24n2n+1.

  6. τ(Kr,sPn)=(r+s+m)(r+m)s1(s+m)r12m(r+s+2)24×r+s+2+(r+s+2)24mr+s+2(r+s+2)24m.

  7. τ(Kr,sCm)=(r+s+m)(r+m)s1(s+m)r12m×(r+s)×r+s+2+(r+s+2)24m+r+s+2(r+s+2)24m2m+1.

  8. τ(Kr,sKm)=(r+m)s1(s+m)r1(r+s+m)m.

  9. τ(Km,nKr,s)=(m+r+s)n1(n+r+s)m1(r+m+n)s1(s+m+n)r1(m+n+r+s)2.

  10. τ(Km¯Pn)=nm12n(m+2)24×m+2+(m+2)24nm+2(m+2)24n.

  11. τ(Km¯Cn)=nm12n×m×m+2+(m+2)24n+m+2(m+2)24n2n+1.

Proof

  1. The eigenvalues of L(Pm) and L(Pn) are 22cosiπm(0im1) and 22cosjπn(0jn1), respectively. Then applying Equation (1) together with Theorem 3.2, we get τ(PmPn)=1m+n(m+n)i=1m1n+22cosiπmj=1n1m+22cosjπn=Um1n+22Un1m+22.

The explicit formula follows from Equation (7).

  1. The eigenvalues of L(Pm) and L(Cn) are 22cosiπm(0im1) and 22cos2jπn(0jn1), respectively. Then applying Equation (1) together with Theorem 3.2, we get τ(PmCn)=1m+n(m+n)i=1m1n+22cosiπm×j=1n1m+22cos2jπn=Um1n+22Un12m+44=2mUm1n+22Tnm+221.

The explicit formula follows from Equations (4) and (7).

  1. The eigenvalues of L(Cm) and L(Cn) are 22cos2iπm(0im1) and 22cos2jπn(0jn1), respectively. Then applying Equation (1) together with Theorem 3.2, we get τ(CmCn)=1m+n(m+n)i=1m1n+22cos2iπm×j=1n1m+22cos2jπn=Um12n+44Un12m+44=4mnTmn+221Tnm+221.

The explicit formula follows from Equation (4).

  1. The eigenvalues of L(Km) and L(Pn) are 01,mm1 and 22cosiπn(0in1), respectively. Then applying Equation (1) together with Theorem 3.2, we get τ(KmPn)=(m+n)m1i=1n1m+22cosiπn=(m+n)m1Un1m+22.

The explicit formula follows from Equation (7).

  1. The eigenvalues of L(Km) and L(Cn) are 01,mm1 and 22cos2iπn(0in1), respectively. Then applying Equation (1) together with Theorem 3.2, we get τ(KmCn)=(m+n)m1i=1n1m+22cos2iπn=(m+n)m1Un12m+44=2(m+n)m1mTnm+221.

The explicit formula follows from Equation (4).

  1. The eigenvalues of L(Kr,s) and L(Pm) are 01,rs1,sr1,(r+s)1 and 22cosiπm(0im1), respectively. Then applying Equation (1) together with Theorem 3.2, we get τ(Kr,sPm)=(r+m)s1(s+m)r1(r+s+m)i=1m1r+s+22cosiπm=(r+m)s1(s+m)r1(r+s+m)Um1r+s+22.

The explicit formula follows from Equation (7).

  1. The eigenvalues of L(Kr,s) and L(Cm) are 01,rs1,sr1,(r+s)1 and 22cos2iπm(0im1), respectively. Then applying Equation (1) together with Theorem 3.2, we get τ(Kr,sCm)=(r+m)s1(s+m)r1(r+s+m)i=1m1r+s+22cos2iπm=(r+m)s1(s+m)r1(r+s+m)Um12r+s+44=2(r+m)s1(s+m)r1(r+s+m)r+sTmr+s+221.

The explicit formula follows from Equation (4).

  1. The eigenvalues of L(Kr,s) and L(Km) are 01,rs1,sr1,(r+s)1 and 01,mm1, respectively. Then applying Equation (1) together with Theorem 3.2, we get τ(Kr,sKm)=(r+m)s1(s+m)r1(r+s+m)(r+s+m)m1=(r+m)s1(s+m)r1(r+s+m)m.

  2. The eigenvalues of L(Kr,s) and L(Km) are 01,rs1,sr1,(r+s)1 and 01,mn1,nm1,(m+n)1, respectively. Then applying Equation (1) together with Theorem 3.2, we get τ(Km,nKr,s)=(m+r+s)n1(n+r+s)m1(r+m+n)s1(s+m+n)r1(m+n+r+s)2.

  3. The eigenvalues of L(Km¯) and L(Pn) are 01,0m1 and 22cosiπn(0in1), respectively. Then applying Equation (1) together with Theorem 3.2, we get τ(Km¯Pn)=1m+n(m+n)nm1i=1n1m+22cosiπn=nm1Un1m+22.

The explicit formula follows from Equation (7).

  1. The eigenvalues of L(Km¯) and L(Cn) are 01,0m1 and 22cos2iπn(0in1), respectively. Then applying Equation (1) together with Theorem 3.2, we get τ(Km¯Cn)=1m+n(m+n)nm1i=1n1m+22cos2iπn=nm1Un12m+44=nm1×2mTnm+221.

The explicit formula follows from Equation (4).

Theorem 3.4

For m,n,r and s1, we have

  1. τ(PmQn)=Um1(2n1+1)i=1n(m+2i)ni.

  2. τ(CmQn)=12n1[Tm(2n1+1)1]i=1n(m+2i)ni.

  3. τ(KmQn)=(2n+m)m1i=1n(m+2i)ni.

  4. τ(Kr,sQn)=(2n+r)s1(2n+s)r1(2n+r+s)i=1n(r+s+2i)ni.

  5. τ(QmQn)=i=1m(2n+2i)mij=1n(2m+2i)ni.

Proof

  1. The eigenvalues of L(Pm) and L(Qn) are 22cosjπm,(0jm1) and (2i)ni,(0in), respectively, then applying Equation (1) together with Theorem 3.2, we get τ(PmQn)=j=1m12n+22cosjπmi=1n(m+2i)ni=Um1(2n1+1)i=1n(m+2i)ni.

The explicit formula follows from Equation (7).

  1. The eigenvalues of L(Cm) and L(Qn) are 22cos2jπm,(0jm1) and (2i)ni,(0in), respectively, then applying Equation (1) together with Theorem 3.2, we get τ(CmQn)=j=1m12n+22cos2jπm×i=1n(m+2i)ni=Um122n+44×j=1n(m+2i)ni=12n1[Tm(2n1+1)1]i=1n(m+2i)ni.

The explicit formula follows from Equation (4).

The proofs of (iii–v) follows similarly, using the facts, the eigenvalues of L(Km) and L(Kr,s) are 01,mm1; and 01,rs1,sr1,(r+s)1, respectively.

Theorem 3.5

For m,r,s1 and n,k2, we have

  1. τ(PmFn)=m+n+12m+n((n+3)24)((m+3)24)×n+3+(n+3)24mn+3(n+3)24m×m+3+(m+3)24nm+3(m+3)24n.

  2. τ((CmFn)=m+n+12m+n(n+1)(m+3)24×n+3+(n+3)24m+n+3(n+3)24m2m+1]×m+3+(m+3)24nm+3(m+3)24n.

  3. τ(KmFn)=(m+n+1)m2n(m+3)24×m+3+(m+3)24nm+3(m+3)24n.

  4. τ(Kr,sFn)=(r+n+1)s1(s+n+1)r1(r+s+n+1)22n(r+s+3)24×r+s+3+(r+s+3)24nr+s+3(r+s+3)24n.

  5. τ(QmFn)=(2m+n+1)i=1m(n+2i+1)mi2n(2ms+3)24×2m+3+(2m+3)24n2m+3(2m+3)24n.

  6. τ(FkFn)=(k+n+2)22k+n((n+4)24)((k+4)24)×n+4+(n+4)24kn+4(n+4)24k×k+4+(k+4)24nk+4(k+4)24n.

Proof

  1. The eigenvalues of L(Pm) and L(Fn) are 22cosiπm,(0im1) and 0,n+1,32cosjπn,(1jn1), then applying Equation (1) together with Theorem 3.2, we get τ(PmFn)=(m+n+1)i=1m1n+32cosiπmj=1n1m+32cosiπn=(m+n+1)Um1n+32Un1m+32.

The proofs of (ii–vi) follows similarly, using the facts, the eigenvalues of L(Cn),L(Km),L(Kr,s) and L(Qk) are 22cos2iπn,(0in1); 01,mm1; 01,rs1,sr1,(r+s)1 and (2i)ki,(0ik), respectively, as follows:

  1. τ(CmFn)=(m+n+1)×i=1m1n+1+22cos2iπm×j=1n1m+32cosiπn=(m+n+1)Um12n+54Un1m+32=2(m+n+1)n+1Tmn+321Un1m+32.

  2. τ(KmFn)=(m+n+1)m×j=1n1m+32cosjπn=(m+n+1)mUn1m+32.

  3. τ(Kr,sFn)=(r+n+1)s1(s+n+1)r1(r+s+n+1)2j=1n1r+s+32cosiπn=(r+n+1)s1(s+n+1)r1(r+s+n+1)2Un1r+s+32.

  4. τ(QmFn)=i=1m(n+1+2i)mi×(2m+n+1)j=1n12m+32cosjπn=i=1m(n+1+2i)mi×(2m+n+1)Un12m+32.

  5. τ(FkFn)=(k+1+n+1)2×i=1k1n+42cosiπk×j=1n1n+42cosjπn=(k+n+2)2×Uk1n+42×Un1k+42.

The explicit formula follows from Equations (4) and (7).

Theorem 3.6

For m,r,s1 and n,k2, we have:

  1. τ(PmWn)=m+n+12m+n(m+1)(n+3)24×n+3+(n+3)24mn+3(n+3)24m×m+3+(m+3)24n+m+3(m+3)24n2n+1.

  2. τ(CmWn)=m+n+12m+n×(m+1)(n+1)×n+3+(n+3)24m+n+3(n+3)24m2m+1×m+3+(m+3)24n+m+3(m+3)24n2n+1.

  3. τ(KmWn)=(m+n+1)m2n×(m+1)×m+3+(m+3)24n+m+3(m+3)24n2n+1.

  4. τ(Kr,sWn)=(r+n+1)s1(s+n+1)r1(r+s+n+1)22n×(r+s+1)×r+s+3+(r+s+3)24n+r+s+3(r+s+3)24n2n+1.

  5. τ(QmWn)=(2m+n+1)i=1m(n+2i+1)mi2n×(2m+1)×2m+1+(2m+1)24n+2m+1(2m+1)24n2n+1.

  6. τ(WkWn)=12k+n×(k+2)(n+2)×n+4+(n+4)24k+n+4(n+4)24k2k+1×k+4+(k+4)24n+k+4(k+4)24n2n+1.

  7. τ(FkWn)=12n×(k+2)(n+4)24×n+4+(n+4)24kn+4(n+4)24k×k+4+(k+4)24n+k+4(k+4)24n2n+1.

Proof

  1. The eigenvalues of L(Pm) and L(Wn) are 22cosiπm,(0im1) and 0,n+1,32cos2jπn,(1jn1), then applying Equation (1) together with Theorem 3.2, we get τ(PmWn)=(m+n+1)i=1m1n+1+22cosiπmj=1n1m+32cos2jπn=(m+n+1)Um1n+32Un12m+54=2(m+n+1)m+1Um1n+32Tnm+321.

The explicit formula follows from Equations (4) and (7).

The proofs of (ii–vii) follows similarly, using the facts, the eigenvalues of L(Cn),L(Km),L(Kr,s) and L(Qk) are 22cos2iπn,(0in1); 01,mm1; 01,rs1,sr1,(r+s)1 and (2i)ki,(0ik), respectively, as follows:

  1. τ(CmWn)=(m+n+1)i=1m1n+32cos2iπmj=1n1m+32cos2jπn=(m+n+1)Um12n+54Un12m+54=4(m+n+1)(m+1)(n+1)Tmn+321Tnm+321.

  2. τ(KmWn)=(m+n+1)m1(m+n+1)i=1n1m+32cos2iπn=(m+n+1)mUn12m+54=4(m+n+1)m(m+1)Tnm+321.

  3. τ(Kr,sWn)=(n+r+1)s1(n+s+1)r1(r+s+n+1)2i=1n1r+s+32cos2iπn=(n+r+1)s1(n+s+1)r1(r+s+n+1)2Un12r+s+54=2(n+r+1)s1(n+s+1)r1(r+s+n+1)2(r+s+1)Tnr+s+321.

  4. τ(QmWn)=i=1m(n+2i+1)mi×(2m+n+1)j=1n12m+32cos2jπn=i=1m(n+2i+1)mi×(2m+n+1)Un122m+54=22m+1i=1m(n+2i+1)mi×(2m+n+1)Tn2m+321.

  5. τ(WmWn)=i=1m1n+42cos2iπmj=1n1m+42cos2jπn=Um12n+64Un12m+64=4(m+2)(n+2)Tmn+421Tnm+421.

  6. τ(FkWn)=i=1m1n+42cosiπmj=1n1m+42cos2jπn=Um1n+42Un12m+642(m+2)Um1n+42Tnm+421.

The explicit formula follows from Equations(4) and (7).

4. Complexity of corona of two graphs

The corona G1G2 of two graphs G1 and G2 is the graph obtained by taking one copy of G1 (which has n1 vertices) and n1 copies of G2 and then joining the i-th vertex of G1 to every vertex in the copy of G2 [Citation21]. It is easy to see that G1G2 is not isomorphic G2G1.

Theorem 4.1

[Citation22] Let G1 and G2 be graphs of order n1 and n2 respectively. If Let G1 and G2 be graphs of order n1 and n2 respectively. If S(G1)=(λ1,,λn1) and S(G2)=(σ1,,σn2) are the eigenvalues of L(G1) and L(G2) arranged in non-increasing order, then the eigenvalues of L(G1G2) is given by the eigenvaluesσj+1 with multiplicity n1 for j=2,,n2 and (λi+n2+1)±(λi+n2+1)24λi2 for i=1,2,,n1.

Now we can introduce the following theorem:

Theorem 4.2

Let G1 and G2 be graphs of order n1 and n2 respectively. If S(G1)=(λ1,,λn1) and S(G2)=(σ1,,σn2) are the eigenvalues of L(G1) and L(G2), then τ(G1G2)=τ(G1)j=1n21(σj+1)n1.

Theorem 4.3

For m,n,rands1, we have

  1. τ(PmPn)=12n53+5n35nm.

  2. τ(PmCn)=12mn3+5n+35n2n+1m.

  3. τ(CmPn)=m12n53+5n35nm.

  4. τ(CmCn)=m2mn3+5n+35n2n+1m.

  5. τ(KmPn)=mm212n53+5n35nm.

  6. τ(PmKn)=(n+1)m(n1).

  7. τ(KmCn)=mm22mn3+5n+35n2n+1m.

  8. τ(CmKn)=m(n+1)m(n1).

  9. τ(Kr,sPm)=rs1sr112m5(3+5)n(35)nr+s.

  10. τ(PmKr,s)=[(r+s+1)(r+1)s1(s+1)r1]m.

  11. τ(Kr,sCm)=rs1sr112m(3+5)m(35)m2m+1r+s.

  12. τ(CmKr,s)=m[(r+s+1)(r+1)s1(s+1)r1]m.

  13. τ(Kr,sKm)=rs1sr1(m+1)(m1)(r+s).

  14. τ(KmKr,s)=mm2[(r+s+1)(r+1)s1(s+1)r1]m.

  15. τ(Km,nKr,s)=mn1nm1[(r+1)s1(s+1)r1(r+s+1)]m+n.

Proof

Applying Theorem 4.2, we get

  1. τ(PmPn)=i=1n132cosiπnm=Un132m=τ(PmPn)=Un132m=F2nm.

  2. τ(PmCn)=i=1n132cos2iπnm=Un1254m=2Tn321m=(L2n2)m.

  3. τ(CmPn)=mi=1n132cosiπnm=mUn132m=mF2nm.

  4. τ(CmCn)=mi=1n132cos2iπnm=mUn1254m=m2Tn321m=m(L2n2)m.

  5. τ(KmPn)=mm2i=1n132cosiπnm=mm2Un132m=mm2F2nm.

  6. τ(PmKn)=(n+1)m(n1).

  7. τ(KmCn)=mm2i=1n132cos2iπnm=mm2Un1254m=mm22Tn321m=mm2(L2n2)m.

  8. τ(CmKn)=m(n+1)m(n1).

  9. τ(Kr,sPm)=rs1sr1i=1m132cosiπmr+s=rs1sr1Um132r+s=rs1sr1F2mr+s.

  10. τ(PmKr,s)=[(r+s+1)(r+1)s1(s+1)r1]m.

  11. τ(Kr,sCm)=rs1sr1i=1m132cos2iπmr+s=rs1sr1Um1254r+s=rs1sr12Tm321r+s=rs1sr1(L2m2)r+s.

The explicit formula follows from Equations (17) and (19).

Theorem 4.4

For m,n,rands1, we have

  1. τ(QmPn)=22mm1i=1mimi12n5(3+5)n(35)nm.

  2. τ(QmCn)=22mm1i=1mimi12n(3+5)n+(35)n2n+1m.

  3. τ(PmQn)=i=1n(2i+1)mni.

  4. τ(CmQn)=mi=1n(2i+1)mni.

  5. τ(QmQn)=22mm1i=1minij=1n(2j+1)mnj.

  6. τ(KmQn)=mm2i=1n(2i+1)mni.

  7. τ(QmKn)=22mm1(n+1)m(n1)i=1mimi.

  8. τ(Kr,sQm)=rs1sr1i=1m(2i+1)(r+s)mi.

  9. τ(QmKr,s)=22mm1(r+1)m(s1)(s+1)m(r1)(r+s+1)mi=1mimi.

Proof

Applying Theorem 4.2, we get:

  1. τ(QmPn)=22mm1i=1mimij=1n1×32cosjπnm=22mm1i=1mimi[Un132m=22mm1i=1mimiF2nm.

  2. τ(QmCn)=22mm1i=1mimij=1n1×32cos2jπnm=22mm1i=1mimiUn1254m=22mm1i=1mimi×2Tn321m=22mm1i=1mimi(L2n2)m.

The explicit formula follows from Equations (17) and (19).

Theorem 4.5

For m,r,s1 and k,n2, we have

  1. τ(PmFn)=n+223(2+3)n(23)nm.

  2. τ(FnPm)=12n(3+5)n+(35)n2n+1(3+5)n12m(3+5)m+(35)m2m+1n.

  3. τ(CmFn)=mn+223(2+3)n(23)nm.

  4. τ(FnCm)=12n5(3+5)n(35)n12m(3+5)m+(35)m2m+1n.

  5. τ(KmFn)=mm2n+223(2+3)n(23)nm.

  6. τ(FnKm)=(m+1)n(m1)2n5(3+5)n(35)n.

  7. τ(Kr,sFn)=rs1sr1n+223(2+3)n(23)nr+s.

  8. τ(FnKr,s)=(r+1)(s1)(s+1)(r1)(r+s+1)n25(3+5)n(35)n.

  9. τ(QmFn)=22mm1i=1mimin+223(2+3)n(23)n)m.

  10. τ(FnQm)=i=1m(2i+1)nmi×12n5(3+5)n(35)n.

  11. τ(FkFn)=12k5(3+5)k(35)k×n+223(2+3)n(23)nk.

Proof

Applying Theorem 4.2, we get:

  1. τ(PmFn)=i=1n142cosiπnm=(n+2)m[Un1(2)]m.

  2. τ(FnPm)=i=1n132cosiπnj=1m132cosjπmn=Un132Um132n=F2nF2mn.

  3. τ(CmFn)=m(n+2)mi=1n142cosiπnm=m(n+2)m[Un1(2)]m.

  4. τ(FnCm)=i=1n132cosiπni=1m1×32cos2jπmn=Un132Um1254n=Un1322Tnm+321!n=F2n(L2m2)n.

  5. τ(KmFn)=mm2(n+2)mi=1n142cosiπnm=mm2(n+2)m[Un1(2)]m.

  6. τ(FnKm)=(m+1)n(m1)i=1n132cosiπn=(m+1)n(m1)Un132=(m+1)n(m1)F2n

  7. τ(Kr,sFn)=rs1sr1(n+2)r+si=1n142cosiπnr+s=rs1sr1(n+2)r+s[Un1(2)]r+s.

  8. τ(FnKr,s)=(r+1)(s1)n(s+1)(r1)n×(r+s+1)ni=1n132cosiπn=(r+1)(s1)n(s+1)(r1)n×(r+s+1)nUn132=(r+1)(s1)n(s+1)(r1)n×(r+s+1)nF2n.

  9. τ(QmFn)=22mm1i=1mimi×(n+2)mj=1n132cosjπn=22mm1(n+2)m[Un1(2)]mi=1mimi.

  10. τ(FnQm)=i=1n132cosiπnj=1m(2j+1)nmj=Un132i=1m(2j+1)nmj=F2ni=1m(2j+1)nmj.

  11. τ(FkFn)=i=1k132cosiπk×(n+2)k×j=1n142cosjπnk=(n+2)kUk132[Un1(2)]k=F2k(n+2)k[Un1(2)]k.

Theorem 4.6

For m,r,s1 and n,p,q2, we have

  1. τ(PmWn)=n+22(2+3)n+ (23)n2m.

  2. τ(WnPm)=12n(3+5)n+ (35)n2n+112m5(3+5)m(35)mn

  3. τ(CmWn)=mn+22(2+3)n+ (23)n2m.

  4. τ(WnCm)=12n(3+5)n+ (35)n2n+112m(3+5)m+ (35)m2m+1n.

  5. τ(KmWn)=mm2n+22(2+3)n+ (23)n2m.

  6. τ(WnKm)=(n+1)m(n1)2n(3+5)n+ (35)n2n+1.

  7. τ(Kr,sWn)=rs1sr1n+22(2+3)n+ (23)n2r+s.

  8. τ(WnKr,s)=(r+1)n(s1)(s+1)n(r1)(r+s+1)n2n(3+5)n+ (35)n2n+1.

  9. τ(QmWn)=22mm1i=1mimin+22(2+3)n+ (23)n2m.

  10. τ(WnQm)=i=1m(2i+1)nmi×12n(3+5)n+ (35)n2n+1.

  11. τ(WpWq)=12p(3+5)p+ (35)p2p+1×q+22(2+3)q+ (23)q2p.

  12. τ(FpWq)=12n5(3+5)p(35)pq+22(2+3)q+ (23)q2p.

  13. τ(WpFq)=12p(3+5)p+ (35)p2p+1q+223(2+3)q(23)qp.

Proof

Applying Theorem 4.2, we get:

  1. τ(PmWn)=(n+2)mi=1n142cos2iπnm=(n+2)mUn1232m=(n+2)m[Tn(2)1]m.

  2. τ(WnPm)=i=1n132cos2iπnj=1m1×32cosjπmn=Un1254Um132n=2Tn321Um132n=(L2n2)F2mn.

  3. τ(CmWn)=m(n+2)mi=1m142cos2iπnm=m(n+2)mUn1232m=m(n+2)m[Tn(2)1]m.

  4. τ(WnCm)=i=1n132cos2iπnj=1m1×32cos2jπmn=Un1254Um1254n=2Tn321×2Tm321n=(L2n2)(L2m2)n.

  5. τ(KmWn)=mm2(n+2)mi=1n1×42cos2iπnm=mm2(n+2)mUn1232m=mm2(n+2)m[Tn(2)1]m.

  6. τ(WnKm)=(m+1)n(m1)i=1n132cos2iπn=(m+1)n(m1)Un1254=2(m+1)n(m1)Tn321=(m+1)n(m1)(L2n2).

  7. τ(Kr,sWn)=rs1sr1(n+2)r+si=1n1×42cos2iπnr+s=rs1sr1(n+2)r+s×Un1232r+s=rs1sr1(n+2)r+s[Tn(2)1]r+s.

  8. τ(WnKr,s)=(r+1)n(s1)(s+1)n(r1)×(r+s+1)ni=1n1×32cos2iπn=(r+1)n(s1)(s+1)n(r1)×(r+s+1)nUn1254=2(r+1)n(s1)(s+1)n(r1)×(r+s+1)nTn321=(r+1)n(s1)(s+1)n(r1)×(r+s+1)n(L2n2).

  9. τ(QmWn)=22mm1i=1mimi(n+2)mj=1n1×42cos2jπnm=22mm1×i=1mimi(n+2)m×Un1232m=22mm1i=1mimi(n+2)m×[Tn(2)1]m.

  10. τ(WnQm)=j=1n132cos2jπnj=1m×(2i+1)nmi=Un1254×i=1m(2i+1)nmi=2Tn321i=1m(2i+1)nmi=(L2n2)i=1m(2i+1)nmi.

  11. τ(WpWq)=i=1p132cos2iπp(q+2)pj=1q1×42cos2jπqp=Up12×54(q+2)pUq1232p=2(q+2)pTp321[Tq(2)1]p=(L2p2)(q+2)p[Tq(2)1]p.

  12. τ(FpWq)=i=1p132cosiπp(q+2)pj=1q1×42cos2jπqp=Up1(32)(q+2)pUq1232p=(q+2)pUp132[Tq(2)1]p=(q+2)pF2p[Tq(2)1]p.

  13. τ(WpFq)=i=1p132cos2iπp(q+2)pj=1q1×42cosjπqp=(q+2)pUp1254[Uq1(2)]p=2(q+2)pTp(32)1[Uq1(2)]p=(q+2)p(L2p2)[Uq1(2)]p.

The explicit formula follows from Equations (4), (7), (17) and (19).

5. Conclusions

In this work, we investigate the spectrum of the Laplacian matrix of some operations on graphs such as, Join and Corona product. Using spectral graph theory, we proved some interesting trigonometric identities, these identities are of special interest to engineers, physicists and mathematicians. We can also develop, using this technique another set of identities.

Acknowledgments

The author would like to record their indebtedness and thankfulness to the reviewers for their valuable and fruitful comments as well as for their powerful reading and suggestions.

Disclosure statement

No potential conflict of interest was reported by the author.

References

  • Applegate DL, Bixby RE, Chvátal V, et al. The traveling salesman problem: a computational study. Princeton (NJ): Princeton University Press; 2006.
  • Cvetkovie˘ D, Doob M, Sachs H. Spectra of graphs: theory and applications. 3rd ed. Heidelberg: Johann Ambrosius Barth; 1995.
  • Kirby EC, Klein DJ, Mallion RB, et al. A theorem for counting spanning trees in general chemical graphs and its particular application to toroidal fullerenes. Croat Chem Acta. 2004;77:263–278.
  • Boesch FT, Salyanarayana A, Suffel CL. A survey of some network reliability analysis and synthesis results. Networks. 2009;54:99–107. doi: 10.1002/net.20300
  • Boesch FT. On unreliability polynomials and graph connectivity in reliable network synthesis. J Graph Theory. 1986;10:339–352. doi: 10.1002/jgt.3190100311
  • Wu FY. Number of spanning trees on a lattice. J Phys A. 1977;10:113–115. doi: 10.1088/0305-4470/10/6/004
  • Zhang F, Yong X. Asymptotic enumeration theorems for the number of spanning trees and Eulerian trail in circulant digraphs & graphs. Sci China Ser. 1999;A43(2):264–271.
  • Chen G, Wu B, Zhang Z. Properties and applications of Laplacian spectra for Koch networks. J Phys A Math Theor. 2012;45:025102. doi: 10.1088/1751-8113/45/2/025102
  • Atajan T, Inaba H. Network reliability analysis by counting the number of spanning trees. ISCIT 2004, IEEE International Symposium on Communication and Information Technology 1; Sapporo, Japan; 2004. p. 601–604.
  • Brown TJN, Mallion RB, Pollak P, et al. Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes. Discrete Appl. Math. 1996;67:51–66. doi: 10.1016/0166-218X(96)85158-4
  • Kirchhoff GG. Über die auflösung der gleichungen auf welche man bei der untersucher der linearen verteilung galuanischer strome gefhrt wird. Ann Phg Chem. 1847;72:497–508. doi: 10.1002/andp.18471481202
  • Biggs NL. Algebraic graph theory. 2nd ed. Cambridge: Cambridge University Press; 1993. p. 205.
  • Daoud SN. The deletion-contraction method for counting the number of spanning trees of graphs. Eur J Phys Plus. 2015;130(10):1–14. doi: 10.1140/epjp/i2015-15217-y
  • Kelmans AK, Chelnokov VM. A certain polynomial of a graph and graphs with an extremal number of trees. J Comb Theor B. 1974;16:197–214. doi: 10.1016/0095-8956(74)90065-3
  • Boesch FT, Prodinger H. Spanning tree formulas and Chebyshev polynomials. J Graphs Comb. 1986;2:191–200. doi: 10.1007/BF01788093
  • Andrews G. Number theory. London: W. B. Saunders Company; 1971.
  • Guiduli B. Topics in theory of number. Hungary: Springer Sciences; 2003.
  • Balakrishnan R, Ranganathan K. A textbook of graph theory. New York (NY): Springer; 2000.
  • Daoud SN. Complexity of cocktail party graph and crown graph. Am J Appl Sci. 2012;9(2):202–207. doi: 10.3844/ajassp.2012.202.207
  • Daoud SN. Generating formulas of the number of spanning trees of some special graphs. Eur J Phys Plus. 2014;129(7):1–14. doi: 10.1140/epjp/i2014-14146-7
  • Harary F. Graph theory. Reading (PA): Addison-Wesley; 1969.
  • Liu Q. The Laplacian spectrum of corona of two graphs. Kragujevac J Math. 2014;8:163–170. doi: 10.5937/KgJMath1401163L