(集美大学理学院,福建 厦门 361021)
(School of Sciences,Jimei University,Xiamen 361021,China)
generalized edge corona; normalized Laplacian spectrum; degree-Kirchhoff index; spanning tree
DOI: 10.6043/j.issn.0438-0479.201709005
备注
设G和H1,H2,…,Hm是简单图,其中G的边数为m.对每一个i∈{1,2,…,m},把G的第i条边的每一个顶点与Hi的每一个顶点相连,得到的图记为G[Hi]m1,称为由G和H1,H2,…,Hm得到的广义边冠图.主要研究了G[Hi]m1 的normalized Laplacian谱,计算了G[Hi]m1 的degree-Kirchhoff指标和生成树的数目.
Let G and H1,H2,…,Hm be simple graphs,where G contains m edges.For each i∈{1,2,…,m},we join edges between two end-vertices of the i' th edge of G and each vertex of Hi,and obtain a new graph,denoted by G[Hi]m1,which is called to be the generalized edge corona of G and H1,H2,…,Hm.In this paper,we determine the normalized Laplacian spectrum of G[Hi]m1.For applications,the degree-Kirchhoff index and the number of spanning trees of G[Hi]m1 are considered.
引言
在本文中,In和jn分别表示n阶单位矩阵和n维全1列向量.设G=(V(G),E(G))是一个图,其顶点集V(G)={v1,v2,…,vn},边集E(G)={e1,e2,…,em}.假设A(G),R(G)和D(G)分别表示图G的邻接矩阵、关联矩阵和度对角矩阵,L(G)=D(G)-1/2(D(G)-A(G))D(G)-1/2 表示图G的normalized Laplacian矩阵.L(G)的特征值记为0=δ1(G)≤δ2(G)≤…≤δn(G),则多项式χ(L(G); δ)=det(δIn-L(G))称为G的normalized Laplacian特征多项式.
Hou等[1]定义的图G和图H的边冠图GH如下:假设图G有m条边 e1,e2,…,em,H1,H2,…,Hm为H的m个拷贝,把G的每一条边ei(1≤i≤m)的两个端点与Hi中的每个顶点都相连,得到的图就是GH,进而得到了有关边冠图GH的一些谱性质.Cui等[2]得到了两个图的边冠图的无符号Laplacian谱.
定义1 设G是一个含有n1个顶点与m条边的简单图,H1,H2,…,Hm均为含有n2个顶点与m2条边的简单图,G是H1,H2,…,Hm的广义边冠图记为G[Hi]m1,即指把图G的每一条边ei的两个端点与Hi(1≤i≤m)中的每个顶点都相连得到的图.
由以上定义,广义边冠图G[Hi]m1 的顶点数为n1+mn2,边数为m+mm2+2mn2.
1 预备知识
引理1[3] 设矩阵A=(A11 A12
A21 A22),其中A11和A22是可逆矩阵.则
det(A11 A12
A21 A22)=det(A22)det(A11-A12A-122 A21).
设A和B分别是m×n和p×q矩阵,定义A和B的张量积(Kronecker积)AB为如下的mp×nq矩阵:
AB=(a11B a12B … a1nB
a21B a22B … a2nB
am1B am2B … amnB).
设G是一个含有n1个顶点与m条边的r1-正则图,H1,H2,…,Hm是都有n2个顶点的r2-正则图.由广义边冠图G[Hi]m1 的定义可知,它的邻接矩阵有如下形式:
A(G[Hi]m1)=(A(G)R(G)jTn2
R(G)Tjn2 B),
其中R(G)为G的边关联矩阵,
B=(A(H1)0 … 0
0 A(H2)… 0
0 0 … A(Hm)).
广义边冠图的度对角矩阵为
D(G[Hi]m1)=((1+n2)r1In1 0
0(r2+2)In2m).
根据定义,可得到广义边冠图G[Hi]m1的normalized Laplacian矩阵为
L(G[Hi]m1)=
((L(G)+n2In1)/(1+n2)(-R(G)jTn2)/((r1(1+n2)(r2+2))1/2)
(-R(G)Tjn2)/((r1(1+n2)(r2+2))1/2)(r2L(Hi|m1)+2In2m)/(r2+2)),(1)
其中
L(Hi|m1)=(L(H1)0 … 0
0 L(H2)… 0
0 0 … L(Hm)).
定义2 为了方便书写,引入如下一个记号:
χL(H)(δ)=R(G)jTn2 (δIn2m-
(r2L(Hi|m1)+2In2m)/(r2+2))-1R(G)Tjn2.
引理2
χL(H)(δ)=(n2(r2+2))/(δ(r2+2)-2)(A(G)+r1In1).(2)
证明 由已知条件可知:L(Hi)=In2-1/(r2)A(Hi),其中A(Hi)的每一行和为r2,所以L(Hi)的每一行的元素和为零,则
(δIn2m-(r2L(Hi|m1)+2In2m)/(r2+2))R(G)T
jn2=(δ-2/(r2+2))R(G)Tjn2,
因此
χL(H)(δ)=((R(G)jTn2)(R(G)Tjn2))/(δ-2/(r2+2))=
(n2(r2+2))/(δ(r2+2)-2)(A(G)+r1In1).
2 主要结论
当G与所有Hi均为正则图时,本节得到广义边冠图G[Hi]m1的normalized Laplacian谱.
定理1 设G是一个有n1个顶点与m条边的r1-正则图,H1,H2,…,Hm都是有n2个顶点的r2-正则图,那么
χ(L(G[Hi]m1); δ)=
(rn2m2)/((r2+2)n2m(1+n2)n1(r2δ+2δ-2)n1)·
∏mi=1χ(L(Hi);(r2+2)/(r2)δ-2/(r2))·
∏n1j=1[δ(1+n2)(r2δ+2δ-2)-n22δ(r2+2)+
(n2+2-r2δ-2δ)δj],
其中0=δ1≤δ2≤…≤δn1是图G的normalized Laplacian特征值.
证明 由式(1)和(2)结合引理1,可得到
χ(L(G[Hi]m1); δ)=
det(δIn2m-(r2L(Hi|m1)+2In2m)/(r2+2))·
det(δIn1-(L(G)+n2In1)/(1+n2)-
1/(r1(1+n2)(r2+2))R(G)
jTn2(δIn2m-(r2L(Hi|m1)+2In2m)/(r2+2))-1
R(G)Tjn2)=
det〖JB<4(〗(δ-2/(r2+2))In2m-
(r2)/(r2+2)(L(H1)
L(H2)
L(Hm))〖JB>4)〗·
det(δIn1-(L(G)+n2In1)/(1+n2)-
1/(r1(1+n2)(r2+2))·(n2(r2+2))/(δ(r2+2)-2)(A(G)+
r1In1))=((r2)/(r2+2))n22m·
det〖JB<5(〗((r2+2)/(r2)δ-2/(r2))In2m-
(L(H1)
L(H2)
L(Hm))〖JB>5)〗·
1/([(1+n2)(r2δ+2δ-2)]n1)
det((δ(1+n2)(r2δ+2δ-2)-n2δ(r2+
2))In1+n2(In1-(A(G))/(r1))-(r2δ+2δ-
2)L(G))=((r2)/(r2+2))n2m∏mi=1χ((LHi);
(r2+2)/(r2)δ-2/(r2))·1/([(1+n2)(r2δ+2δ-2)]n1)·
∏n1j=1[δ(1+n2)(r2δ+2δ-2)-n2δ(r2+2)+
(n2/sub>2+2-r2δ-2δ)δj]=
(rn2m2)/((r2+2)n2m(1+n2)n1(r2δ+2δ-2)n1)·
∏mi=1χ(L(Hi);(r2+2)/(r2)δ-2/(r2))·∏n1j=1[δ(1+
n2)(r2δ+2δ-2)-n2δ(r2+2)+(n2+
2-r2δ-2δ)δj],
定理由此得证.
设图G的normalized Laplacian特征值是0=δ1≤δ2≤…≤δn1,图H1,H2,…,Hm的normalized Laplacian特征值是0=δ(i)1≤δ(i)2≤…≤δ(i)n2,1≤i≤m.假设
ξj,(-overξ)j=((r2+2)δj+n2(r2+4)+2±
((r2+2)δj+n2(r2+2)+2(1+n2))2-
4(1+n2)(2+n2)(r2+2)δj)1/2·
(2(r2+2)(1+n2))-1.
由定理1,很容易得到以下推论.
推论1 设G是一个有n1个顶点与m条边的r1-正则图,H1,H2,…,Hm都是有n2个顶点的r2-正则图,那么广义边冠图G[Hi]m1的normalized Laplacian谱是
(2/(r2+2)(r2δ(1)i+2)/(r2+2)(r2δ(2)i+2)/(r2+2)…
m-n1 2≤i≤n2 2≤i≤n2 …
(r2δ(m)i+2)/(r2+2)ξj(-overξ)j
2≤i≤n2 1≤j≤n1 1≤j≤n1).
3 应 用
上一节主要得到了有关广义边冠图的normalized Laplacian谱,作为这一结果的应用,本节计算广义边冠图的degree-Kirchhoff指标和生成树数目.
假设图G是一个有n个顶点与m条边的简单连通图,它的normalized Laplacian特征值为0=δ1≤δ2≤…≤δn.图G的degree-Kirchhoff指标Kf*(G)由Chen等[4]定义如下:
Kf*(G)=∑i<jdidjrij,
其中,di与dj表示图G的顶点i与j的度,rij表示图G的顶点i和j之间的电阻距离.同时他们证明了对于一个含有n个顶点与m条边的简单连通图,其degree-Kirchhoff指标为
Kf*(G)=2m∑nj=21/(δj),
其中,δj为图G的非零normalized Laplacian特征值.关于计算生成树数目的方法有多种,这里主要研究利用图的normalized Laplacian谱进行计算.设G是一个有n个顶点与m条边的简单连通图,则其生成树数目的公式如下[5]
t(G)=1/(2m)∏ni=1di∏nj=2δj,
其中,di表示图G中顶点i的度,δj为图G的非零normalized Laplacian特征值.
引理3 设K2是两个顶点的完全图,H是一个有n2个顶点的r2-正则图,0=δ1≤δ2≤…≤δn2 是图H的normalized Laplacian特征值,则边冠图K2H的degree-Kirchhoff 指标是
Kf*(K2H)=(1+n2)(2+r2)+
((1+n2)(2+4n2+n2r2))/(2+n2)+(2+4n2+
n2r2)(2+r2)∑n2i=21/(r2δi+2).
证明 由定理1可知,边冠图K2H的norma-lized Laplacian谱是
0,(2+n2)/(1+n2),(2+4n2+n2r2)/((1+n2)(2+r2)),(r2δ2+2)/(r2+2),
(r2δ3+2)/(r2+2),…,(r2δn2+2)/(r2+2),
又有|E(K2H)|=1+(n2r2)/2+2n2=(2+4n2+n2r2)/2,则K2H的degree-Kirchhoff 指标为
Kf*(K2H)=(2+4n2+n2r2)((1+n2)/(2+n2)+
((1+n2)(2+r2))/(2+4n2+n2r2)+(r2+2)/(r2δ2+2)+(r2+2)/(r2δ3+2)+
…+(r2+2)/(r2δn2+2))=(1+n2)(2+r2)+
((1+n2)(2+4n2+n2r2))/(2+n2)+(2+4n2+
n2r2)(2+r2)∑n2i=21/(r2δi+2).
由此引理得证.
定理2 设G是一个有n1个顶点与m条边的r1-正则图,H1,H2,…,Hm都是有n2个顶点的r2-正则图,则广义边冠图G[Hi]m1的degree-Kirchhoff指标是
Kf*(G[Hi]m1)=((n2r2+4n2+2)2)/(2(n2+2))Kf*(G)+
m∑mi=1Kf*(K2Hi)+
(m(r2+2)(2+n2r2+4n2)(m-n1))/2+
(m-m2)(1+n2)(r2+2)+
((r2n2+4n2+2)[m(r2+2)(n1-1)-m2(n2+1)])/(2+n2).
证明 由广义边冠图G[Hi]m1 的定义可知,其边数|E(G[Hi]m1)|=m/2(2+4n2+n2r2).由推论(1)可知,当δ1=0时,ξ1=((r2+4)n2+2)/((r2+2)(n2+1)),(-overξ)1=0; 当δj≠0时,1/(ξj)+1/((-overξ)j)=(n2(r2+4)+(r2+2)δj+2)/(δj(n2+2)),则广义边冠图G[Hi]m1 的degree-Kirchhoff 指标为
Kf*(G[Hi]m1)=m(2+4n2+
n2r2)(((r2+2)(m-n1))/2+∑n2i=2(r2+2)/(r2δ(1)i+2)+
∑n2i=2(r2+2)/(r2δ(2)i+2)+…+∑n2i=2(r2+2)/(r2δ(m)i+2)+
((r2+2)(n2+1))/((r2+4)n2+2)+
∑n1j=2(n2(r2+4)+δj(r2+2)+2)/(δj(n2+2)))=
m(2+4n2+n2r2)(((r2+2)(m-n1))/2+
(r2+2)∑ms=1∑ni=21/(r2δ(s)i+2)+((r2+2)(n2+1))/(r2n2+4n2+2)+
((r2+2)(n1-1))/(n2+2)+(n2(r2+4)+2)/(n2+2)∑n1j=21/(δj))=
((n2r2+4n2+2)2)/(2(n2+2))Kf*(G)+m(r2+2)(2+
n2r2+4n2)((m-n1)/2+∑ms=1∑n2i=21/(r2δ(s)i+2))+
m(r2+2)(n2+1)+
(m(r2n2+4n2+2)(r2+2)(n1-1))/(n2+2)=
((n2r2+4n2+2)2)/(2(n2+2))Kf*(G)+
(m(r2+2)(2+n2r2+4n2)(m-n1))/2+
m∑mi=1Kf*(K2Hi)-m2(1+n2)(r2+2)-
(m2(r2n2+4n2+2)(n2+1))/(n2+2)+
m(r2+2)(n2+1)+
(m(r2n2+4n2+2)(r2+2)(n1-1))/(n2+2)=
((n2r2+4n2+2)2)/(2(n2+2))Kf*(G)+
m∑mi=1Kf*(K2Hi)+
(m(r2+2)(2+n2r2+4n2)(m-n1))/2+
(m-m2)(1+n2)(r2+2)+
((r2n2+4n2+2)[m(r2+2)(n1-1)-m2(n2+1)])/(2+n2).
定理得证.
利用图的生成树的数目与其Laplacian特征值之间关系,下面的引理是显然的.
引理4 设K2是两个顶点的完全图,H是一个有n2个顶点的r2-正则图,0=μ1≤μ2≤…≤μn2是图H的Laplacian特征值,则边冠图K2H的生成树数目为
t(K2H)=(n2+2)(μ2+2)(μ3+2)…
(μn2+2).
定理3 设G是一个有n1个顶点与m条边的r1-正则图,H1,H2,…,Hm都是有n2个顶点的r2-正则图,则广义边冠图G[Hi]m1 的生成树数目是
t(G[Hi]m1)=
(2/(n2+2))m-n1+1t(G)∏mi=1t(K2Hi).
证明 类似定理2的证明过程,可知G[Hi]m1的所有非零normalized Laplacian特征值的乘积为
∏δ=(2/(r2+2))m-n1(∏n2i=2(2+r2δ(1)i)/(r2+2)
∏n2i=2(2+r2δ(2)i)/(r2+2)…∏nni=2(2+r2δ(m)i)/(r2+2).
((r2+4)n2+2)/((r2+2)(n2+1))∏n1j=2(δj(n2+2))/((r2+2)(n2+1))=
(2m-n1(n2+2)n1-1(r2n2+4n2+2))/((r2+2)mn2(n2+1)n1)
∏n1j=2δj∏ms=1∏n2i=2(2+r2δ(s)i).(1)
又因为图Hi(1≤i≤m)的 normalized Laplacian特征值是0=δ(i)1≤δ(i)2≤…≤δ(i)n2,且Hi是r2-正则图,于是Hi的Laplacian特征值是0=r2δ(i)1≤r2δ(i)2≤…≤r2δ(i)n2.
∏δ=(2m-n1(n2+2)n1-1(r2n2+4n2+2))/((r2+2)mn2(n2+1)n1)
∏n1j=2δj∏ms=1∏n2i=2(2+r2δ(s)i)=
(2m-n1(n2+2)n1-m-1(r2n2+4n2+2))/((r2+2)mn2(n2+1)n1)
∏n1j=2δj∏mi=1t(K2Hi)=
(2m-n1(n2+2)n1-m-1(r2n2+4n2+2)n1)/((r2+2)mn2(n2+1)n1rn1-11 )
t(G)∏mi=1t(K2Hi).
因此G[Hi]m1 的生成树数目为
t(G[Hi]m1)=((r1+r1n2)n1(r2+2)n2m)/(m(2+4n2+n2r2))
∏δ=(2/(n2+2))m-n1+1t(G)∏mi=1t(K2Hi).
证毕.
- [1] HOU Y P,SHIU W C.The spectrum of the edge corona of two graphs[J].Electronic J Linear Alg,2010,20:586-594.
- [2] CUI S Y,TIAN G X.The signless Laplacian spectrum of the(edge)corona of two graphs[J].Utilitas Mathematica,2012,88:287-297.
- [3] BAPAT R B.Graphs and matrices[M].Berlin:Springer,2010:125-140.
- [4] CHEN H Y,ZHANG F J.Resistance distance and the normalized Laplacian spectrum[J].Discrete Appl Math,2007,155:654-661.
- [5] FAN C.Spectral graph theory(CBMS regional conference series in mathematics 92)[J].View Issue TOC,1998,30(2):197-199.
- [6] LAALI A R F,JAVADI H H S,KIANI D.Spectra of generalized corona of graphs[J].Linear Alg Appl,2016,493:411-425.
- [7] HARARY F.Graph theory[J].Advanced Book Program,1969,2(1):67-128.
- [8] BIGGS N L.Algebraic graph theory[M].2nd ed.Cambridge:Cambridge University Press,1993:151-181.
- [9] LIU Q.The Laplacian spectrum of corona of two graphs[J].Kragujevac J Math,2014,38:163-170.
- [10] FRUCHT R,HARARY F.On the corona of two graphs[J].Aequationes Math,1970,4(1/2):322-325.
- [11] BARIK S,PATI S,SARMA B K.The spectrum of the corona of two graphs[J].SIAM J Discrete Math,2007,24:47-56.
- [12] WANG S L,ZHOU B.The signless Laplacian Spectra of the corona and edge corona of two graphs[J].Linear and Multilinear Algebra,2013,61:197-204.