398
Views
4
CrossRef citations to date
0
Altmetric
Original Article

The adjacency spectrum of two new operations of graphsFootnoteFootnote

, &
Pages 284-290 | Received 12 Jun 2017, Accepted 20 Oct 2017, Published online: 10 Jun 2020

Abstract

Let G be a graph and A=A(G) be its adjacency matrix. The eigenvalues μ1,μ2,,μn of A(G) are the eigenvalues of G and form the adjacency spectrum, denoted by Spec(G). In this paper, we introduce two new operations G1k(G3G2) and (G4G1)k(G3G2), and describe the adjacency spectra of G1k(G3G2) and (G4G1)k(G3G2) of regular graphs G1, G2 and arbitrarily graphs G3, G4 in terms of their adjacency spectra. As the applications, we obtain some new integral spectrum graphs.

1 Introduction

All graphs considered in this paper are undirected, finite and simple graphs. Let G be a graph with the vertex set V(G)={v1,v2,,vn}. The adjacency matrix A(G) of G is an n×n matrix whose (i,j)th entry, ai,j, is 1 if the ith vertex of G is adjacent to the jth vertex of G and 0 otherwise. The eigenvalues of A(G) are called the eigenvalues of G and they form the adjacency spectrum of G, denoted by Spec(G). The properties of graph spectra and its applications were inducted in [Citation1]. In this paper, we follow [Citation2] for graph theoretic terminology and we only consider the adjacency spectrum of G.

In [Citation3], Harary and Schwenk initiated the problem of finding (describing) all graphs with integral spectrum. In general, this problem seems to be intractable. Some special results were obtained only for certain classes of graphs (see e.g. [4–11Citation[4]Citation[5]Citation[6]Citation[7]Citation[8]Citation[9]Citation[10]Citation[11]]).

The cartesian product of graphs G and H, denoted by GH, is the graph with vertex set V(G)×V(H)={(a,v):aV(G),vV(H)}, and (a,v) is adjacent to (b,w) whenever a=b and {v,w}E(H), or v=w and {a,b}E(G).

Let G1i=G1 and G2i=G2 (1ik) be k copies of graphs G1 and G2, respectively, Gj (j=3,4) is an arbitrary graph. The first operation G1k(G3G2) of G1, G2 and G3 is obtained by making the Cartesian product of two graphs G3 and G2, thus produces k copies G2i (1ik) of G2, then makes k joins G1iG2i,i=1,2,,k. Note that if G3=P2, the first operation G12(P2G2) is the Indu–Bala product G1G2 in [Citation12]. The second operation (G4G1)k(G3G2) of G1, G2, G3 and G4 is obtained by making the Cartesian product of two graphs G3 and G2, produces k copies G2i (1ik) of G2 and making the Cartesian product of two graphs G4 and G1, produces k copies G1i (1ik) of G1, then makes k joins G1iG2i,i=1,2,,k. K24(C4P3) and (C4K2)4(C4P3) are shown in .

Fig. 1 The two new operations K24(C4P3) and (C4K2)4(C4P3).

In this paper, we describe the adjacency spectra of G1k(G3G2) and (G4G1)k(G3G2) for regular graphs G1, G2 and arbitrarily graphs G3, G4 in terms of their adjacency spectra. By using these results, we can construct new integral spectrum graphs.

2 Preliminaries

In this section, we present some lemmas which will be used later in order to prove our main results.

The Kronecker product of matrices A=(aij) and B, denoted by AB, is defined to be the partition matrix (aijB). See [Citation1]. In cases where each multiplication makes sense, we have M1M2M3M4=(M1M3)(M2M4).

This implies that for nonsingular matrix M and N, (MN)1=M1N1. Recall also that for square matrices M and N of order k and s, respectively. det(MN)=(detM)k(detN)s.

If M1 is nonsingular, then detM1M2M3M4=det(M1)det(M4M3M11M2).

Let 1n be the column vector of size n with all entries equal to one, 0n a column zero vector of size n, and In the identity matrix of order n. Let e1×ni be the ith unit column vector of size n for i=1,2,,n. For a vertex u of a graph G, let dG(u) be the degree of vertex u in G. For vertices u and v in a graph, uv means that v is adjacent to u.

Lemma 2.1

[Citation1]

If the graph G1 has n1 vertices and the n1×n1 adjacency matrix A1, and the graph G2 has n2 vertices and the n2×n2 adjacency matrix A2, then the adjacency matrix of the Cartesian product of both graphs is given by A1A2=A1In2+In1A2.

Lemma 2.2

[Citation1]

Let A and B be square matrices of orders m and n, respectively, with eigenvalues λi (1im) and μj (1in). Then the eigenvalues of AIn+ImB are λi+μj. Moreover, if Xi is an eigenvector of A affording λi and Yj is an eigenvector of B affording μj, then XiYj is an eigenvector of AIn+ImB affording λi+μj.

3 The adjacency spectra of G1k(G3G2) and (G4G1)k(G3G2)

First we will describe the spectrum of G1k(G3G2) for regular graphs G1, G2 and an arbitrary graph G3 in terms of their spectra.

Theorem 3.1

For i=1,2, let Gi be an ri regular graph with ni vertices and λi,1=riλi,2λi,3λi,ni be the eigenvalues of Gi. Let G3 be an arbitrary graph with |V(G3)|=k, V(G3)={v1,v2,,vk} and Spec(G3)={μ3,1,μ3,2,,μ3,k}. Then the spectrum of G1k(G3G2) is the multi-set consisting of the numbers λ1,j for j=2,3,,n1, each with multiplicity k; μ3,j+λ2,i for i=2,,n2,j=1,2,,k; 2k multiplicity-one eigenvalues (r1+r2+μ3,j)±(r1r2μ3,j)2+4n1n22 for each eigenvalue μ3,j (j=1,2,,k) of A(G3).

Proof

By a proper labeling of the vertices and Lemma 2.1, the adjacency matrix A of G1k(G3G2) can be written in the following form (J stands for the all-1 matrix): A=IkA1IkJn1×n2IkJn2×n1A3In2+IkA2,where Ai=A(Gi) (i=1,2,3).

As a regular graph, G1 has the all-one vector 1 as an eigenvector corresponding to the eigenvalue r1, while all the other eigenvectors are orthogonal to 1. Note that as G1 may not be connected, r1 need not be a simple eigenvalue of G1. Let λ1,j (j=2,,n1) be an arbitrary eigenvalue of A(G1) with corresponding eigenvector Xj, such that 1TXj=0. For each p=1,2,,k, [e1×kpXj,01×kn2]T is an eigenvector of A corresponding to the eigenvalue λ1,j. This is because IkA1IkJn1×n2IkJn2×n1A3In2+IkA2ek×1pXj0kn2×1=(Ikek×1p)(A1Xj)(Ikek×1p)(Jn2×n1Xj)=ek×1p(λ1,jXj)0kn2×1=λ1,jen1×1pXj0kn2×1.

Let λ2,i (i=2,,n2) be an arbitrary eigenvalue of A(G2) with corresponding eigenvector Yi, such that 1TYi=0. Let μ3,j (j=1,2,,k) be an arbitrary eigenvalue of A(G3) with corresponding eigenvector Zj. By Lemma 2.2 and a similar argument we see that the k(n21) vectors [01×kn1,ZjYi]T are eigenvectors of A with corresponding eigenvalues μ3,j+λ2,i.

In this way we obtain eigenvectors of the form [e1×kpXj,01×kn2]T, [01×kn1,ZjYi]T and these account for a total of k(n11)+k(n21) eigenvectors. All these eigenvectors are orthogonal to the 2k vectors [01×(t1)n1,11×n1,01×(kn1tn1+kn2)]T and [01×(kn1+(t1)n2),11×n2,01×(kt)n2]T,1tk. This means that these 2k vectors span the space spanned by the remaining 2k eigenvectors of A. Thus the remaining 2k eigenvectors of A are of the form [a111×n1,a211×n1,,ak11×n1,b111×n2,b211×n2,,bk11×n2]T=[a11×n1,b11×n2]T for some [a1,a2,,ak,b1,b2,,bk]01×2k, where a=[a1,a2,,ak] and b=[b1,b2,,bk].

If ν is an eigenvalue of A with an eigenvector [a11×n1,b11×n2]T, then A[a11×n1,b11×n2]T=ν[a11×n1,b11×n2]Tand AG111×n1T=r111×n1T, AG211×n2T=r211×n2T. We get the system of 2k equations: (1) air1+bin2=νai,i=1,2,,k;ain1+bir2+vivjbj=νbi,i=1,2,,k;(1) where vi,vjV(G3).

This shows that ν is also an eigenvalue of the matrix M1 since [a1,a2,,ak,b1,b2,,bk]01×2k, where M1=r1Ikn2Ikn1Ikr2Ik+AG3.

Next we consider the eigenvalues of the matrix M1, equivalently consider the roots of det(νI2kM1)=0, and if ν=r1, (Equation1) gives bi=0, since bin2=0, n2>0 and this in turn implies ai=0, since n1>0, a contradiction. Thus νr1, so (νr1)Ik is nonsingular, we have det(νI2kM1)=det((νr1)Ik)det((νr2)IkAG3(n2(νr1)1n1)Ik)=(νr1)kdet((νr2n1n2νr1)IkAG3).Thus, the 2k eigenvalues are obtained by solving νr2n1n2νr1=μ3,j (j=1,2,,k) because of Spec(G3)={μ3,1,μ3,2,,μ3,k}, thus eigenvalues are ν=(r1+r2+μ3,j)±(r1r2μ3,j)2+4n1n22the theorem is proved.

If we allow G3=P2, the spectrum of G12(P2G2) is the spectrum of the Indu–Bala product G1G2. Then we have the following.

Corollary 3.2

For i=1,2, let Gi be an ri regular graph with ni vertices and λi,1=riλi,2λi,3λi,ni be the eigenvalues of Gi. Let G3 be P2 and Spec(P2)={1,1}. Then the spectrum of G12(P2G2) is the multi-set consisting of the numbers λ1,j for j=2,3,,n1, each with multiplicity 2; ±1+λ2,i for i=2,,n2 and four more eigenvalues are (r1+r2+1)±(r1r21)2+4n1n22 and (r1+r21)±(r1r2+1)2+4n1n22.

Proof

By Theorem 3.1, the spectrum of G12(P2G2) is the multi-set consisting of the numbers λ1,j for j=2,3,,n1, each with multiplicity 2; ±1+λ2,i for i=2,,n2 and 4 more eigenvalues are (r1+r2+1)±(r1r21)2+4n1n22 and (r1+r21)±(r1r2+1)2+4n1n22, because of μ3,j=±1, the theorem is proved.

In the following, we will consider the spectrum of (G4G1)k(G3G2) for regular graphs G1, G2 and arbitrary graphs G3, G4 in terms of their spectra.

Theorem 3.3

For i=1,2, let Gi be an ri regular graph with ni vertices and let λi,1=riλi,2λi,3λi,ni be the eigenvalues of Gi. Let Gj (j=3,4) be an arbitrary graph with |V(Gj)|=k, V(G3)={v1,v2,,vk}, V(G4)={u1,u2,,uk} and Spec(Gj)={μj,1,μj,2,,μj,k}. Then the spectrum of (G4G1)k(G3G2) is the multi-set consisting of the numbers μ4,j+λ1,i for i=2,3,,n1,j=1,2,,k; μ3,j+λ2,i for i=2,,n2,j=1,2,,k; and 2k eigenvalues of a 2k×2k real matrix M2, where M2=r1Ik+AG4n2Ikn1Ikr2Ik+AG3.

Proof

By a proper labeling of the vertices and Lemma 2.1, the adjacency matrix A of (G4G1)k(G3G2) can be written in the form: A=A4In1+IkA1IkJn1×n2IkJn2×n1A3In2+IkA2,where Ai=A(Gi) (i=1,2,3,4).

Let λ1,i (i=2,3,,n1) be an arbitrary eigenvalue of A(G1) with corresponding eigenvector Xi, such that 1TXi=0. Let μ4,j be an arbitrary eigenvalue of A(G4) with corresponding eigenvector Wj. For each i=2,3,,n1 and j=1,2,,k, the k(n11) vectors [WjXi,01×kn2]T are eigenvectors of A corresponding to the eigenvalue μ4,j+λ1,i. This is because A4In1+IkA1IkJn1×n2IkJn2×n1A3In2+IkA2WjXi0kn2×1=(A4Wj)(In1Xi)+(IkWj)(A1Xi)0kn2×1=(μ4,j+λ1,i)WjXi0kn2×1.

Similarly, let λ2,i (i=2,3,,n2) be an arbitrary eigenvalue of A(G2) with corresponding eigenvector Yi, such that 1TYi=0. Let μ3,j (j=1,2,,k) be an arbitrary eigenvalue of A(G3) with corresponding eigenvector Zj. By Lemma 2.2 and a similar argument we see that the k(n21) vectors [01×kn1,ZjYi]T are eigenvectors of A with corresponding eigenvalues μ3,j+λ2,i.

In this way we obtain eigenvectors of the form [WjXi,01×kn2]T, [01×kn1,ZjYi]T and these account for a total of k(n11)+k(n21) eigenvectors. All these eigenvectors are orthogonal to the 2k vectors [01×(t1)n1,11×n1,01×(kn1tn1+kn2)]T and [01×(kn1+(t1)n2),11×n2,01×(kt)n2]T,1tk. This means that these 2k vectors span the space spanned by the remaining 2k eigenvectors of A. Thus the remaining 2k eigenvectors of A are of the form [a111×n1,a211×n1,,ak11×n1,b111×n2,b211×n2,,bk11×n2]T=[a11×n1,b11×n2]T for some [a1,a2,,ak,b1,b2,,bk]01×2k, where a=[a1,a2,,ak] and b=[b1,b2,,bk].

If ν is an eigenvalue of A with an eigenvector [a11×n1,b11×n2]T, then A[a11×n1,b11×n2]T=ν[a11×n1,b11×n2]Tand AG111×n1T=r111×n1T, AG211×n2T=r211×n2T. We get the system of 2k equations: (2) air1+uiujaj+bin2=νai,i=1,2,,k;ain1+bir2+vivjbj=νbi,i=1,2,,k;(2) where ui,ujV(G4) and vi,vjV(G3).

This shows that ν is also an eigenvalue of the matrix M2 since [a1,a2,,ak,b1,b2,,bk]01×2k, where M2=r1Ik+AG4n2Ikn1Ikr2Ik+AG3.

In general, it is difficult to give the explicit formula for all eigenvalues of 2k×2k matrix M2. But for k=2,3, and the cases Gj=P2 or C3 (j=3,4), we have the following.

Corollary 3.4

For i=1,2, let Gi be an ri regular graph with ni vertices and let λi,1=riλi,2λi,3λi,ni be the eigenvalues of Gi. Let G3, G4 be P2 and Spec(P2)={1,1}. Then the spectrum of (P2G1)2(P2G2) is the multi-set consisting of the numbers ±1+λ1,i for i=2,3,,n1; ±1+λ2,i for i=2,,n2 and four eigenvalues are (r1+r22)±(r1r2)2+4n1n22 and (r1+r2+2)±(r1r2)2+4n1n22.

Proof

By Theorem 3.3, the spectrum of (P2G1)2(P2G2) is the multi-set consisting of the numbers ±1+λ1,i for i=2,3,,n1; ±1+λ2,i for i=2,,n2; and four eigenvalues which are the eigenvalues of matrix M2 M2=r1I2+AP2n2I2n1I2r2I2+AP2=r11n201r10n2n10r210n11r2.and the characteristic polynomial of M2 is [x2+(2r1r2)xn1n2r1r2+r1r2+1][x2(2+r1+r2)xn1n2+r1+r2+r1r2+1]=0, then eigenvalues are x=(r1+r22)±(r1r2)2+4n1n22 and x=(r1+r2+2)±(r1r2)2+4n1n22.

Corollary 3.5

For i=1,2, let Gi be an ri regular graph with ni vertices and let λi,1=riλi,2λi,3λi,ni be the eigenvalues of Gi. Let G3, G4 be C3 and Spec(C3)={2,1,1}. Then the spectrum of (C3G1)3(C3G2) is the multi-set consisting of the numbers 2+λ1,i for i=2,3,,n1; 1+λ1,i for i=2,,n1, each with multiplicity 2; 2+λ2,i for i=2,3,,n2; 1+λ2,i for i=2,,n2 each with multiplicity 2 and six eigenvalues are (r1+r22)±(r1r2)2+4n1n22, each with multiplicity 2 and (r1+r2+4)±(r1r2)2+4n1n22.

Proof

By Theorem 3.3, the spectrum of (C3G1)k(C3G2) is the multi-set consisting of the numbers 2+λ1,i for i=2,3,,n1; 1+λ1,i for i=2,,n1, each with multiplicity 2; 2+λ2,i for i=2,3,,n2; 1+λ2,i for i=2,,n2 each with multiplicity 2 and six eigenvalues which are the eigenvalues of matrix M2 M2=r111n2001r110n2011r100n2n100r2110n101r2100n111r2.and the characteristic polynomial of M2 is [x2+(2r1r2)xn1n2r1r2+r1r2+1]2[x2(4+r1+r2)xn1n2+2r1+2r2+r1r2+4]=0, then eigenvalues are x=(r1+r22)±(r1r2)2+4n1n22 and x=(r1+r2+4)±(r1r2)2+4n1n22.

4 Some new integral adjacency spectrum

Which graphs have integral spectra? The number of integral graphs is not only infinite, but one can find them in all classes of graphs and among graphs of all orders. However, they are very rare and difficult to be found [Citation11].

By Corollary 3.2 computation, we have that Ks¯2(P2Ks+1¯) is an integral spectrum graph. In [Citation13], Wang also shows this result.

Theorem 4.1

Let Gi (i=1,2) are both r-regular integral graphs with ni vertices such that n1n2=4t2 where t is also a positive integer and G3=K3t,3t (tN). Then G16t(K3t,3tG2) is an integral spectrum graph.

Proof

By Theorem 3.1, we mainly consider 12t multiplicity-one eigenvalues x=(r1+r2+μ3,j)±(r1r2μ3,j)2+4n1n22where μ3,j (j=1,2,,6t) is an eigenvalue of K3t,3t. For r1=r2=r and n1n2=4t2, then x=(2r+μ3,j)±(μ3,j)2+16t22.We know Spec(K3t,3t)={3t,06t2,3t}, when μ3,j=0, then x=r±2t, each with multiplicity 6t2; when μ3,j=3t, then x=r+4t or x=rt; when μ3,j=3t, then x=r4t or x=r+t.

Thus, the spectrum of G16t(K3t,3tG2) is λ1,i3t+λ2,i3t+λ2,iλ2,ir+2tr2tr+4trtr4tr+t6t11(6t2)6t26t21111.where λ1,i (i=2,,n1) and λ2,i (i=2,,n2) are eigenvalues of G1, G2.

As G1, G2 are both r-regular integral graphs, we have that G16t(K3t,3tG2) is an integral spectrum graph.

Theorem 4.2

Let s,t be a positive integer such that st=p2 where p is also a positive integer, then (P2Ks¯)2(P2Kt¯) and (C3Ks¯)3(C3Kt¯) are both integral spectrum graphs.

Proof

By Corollaries 3.4 and 3.5, we can obtain the spectrum of (P2Ks¯)2(P2Kt¯) is p+1p111p+1p111s+t2s+t211.

and the spectrum of (C3Ks¯)3(C3Kt¯) is p+2p121p+2p112s+t22(s+t2)12.Hence, they are integral spectra.

Finally, the first new graph operation can also be used in constructing cospectral graphs. If G1 and G1, G2 and G2, G3 and G3 are cospectral, then G1k(G3G2) and G1k(G3G2) are cospectral.

Notes

Peer review under responsibility of Kalasalingam University.

This paper supported by the National Natural Science Foundation of China (No. 11571101) and the program for excellent talents in Hunan Normal University (ET13101).

References

  • Cvetković D. Doob M. Sachs H. Spectra of Graphs Theory and Application third ed. 1995 Johann Ambrosius Barth Verlag
  • Bondy J.A. Murty U.S.R. Graph Theory with Applications 1976 Macmillan
  • Harary F. Schwenk A. Which graphs have integral spectra? Bari R. Harary F. Graphs and Combinatorics 1974 Springer-Verlag Berlin 45 51
  • Bussemaker F. Cvetković D. There are exactly 13 connected cubic, integral graphs Univ. Beograd Publ. Elektrotehn. Fak. Ser. Mat. Fiz. 544–576 1976 43 48
  • Balińska K. Cvetković D. Lepović M. Simić S. There are exactly 150 connected integral graphs up to 10 vertices Univ. Beograd Publ. Elektrotehn. Fak. Ser. Mat. 10 1999 95 105
  • Stanić Z. There are exactly 172 connected Q-integral graphs up to 10 vertices Novi Sad J. Math. 37 2 2001 193 205
  • Cvetković D. Cubic integral graphs, Univ Beograd Publ. Elektrotehn. Fak. Ser. Mat. Fiz. 489–541 1975 107 113
  • M. Lepović, S. Simić, K. Balińska, K. Zwerzyński, There are 93 non-regular, bipartite integral graphs with maximal degree four, The Techical University of Poznań,CSC Report No.511, Poznań, 2005.
  • Tang Z. Hou Y. The integral graphs with index 3 and exactly two main eigenvalues Linear Algebra Appl. 433 5 2010 984 993
  • Bapat R.B. Karimi M. Construction of cospectral integral regular graphs Discuss. Math. Graph Theory 37 2017 595 609
  • Balińska K. Cvetković D. Radosavljević Z. Simić S. Stevanović D. A survey on integral graphs Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. 13 2003 42 65
  • Indulal G. Balakrishnan R. Distance spectrum of Indu-Bala product of graphs AKCE Int. J. Graphs Combin. 13 2016 230 234
  • Wang L. (Ph.D. thesis) Integral Trees and Integral Graphs 2005 Univ. Twente