Spectra of Corona Based on the Total Graph  

作　　者：Xue-Qin Zhu Gui-Xian Tian Shu-Yu Cui 

机构地区：[1]College of Mathematics,Physics and Information Engineering,Zhejiang Normal University,Jinhua 321004,Zhejiang,P.R.China [2]Xingzhi College,Zhejiang Normal University,Jinhua 321004,Zhejiang,P.R.China

出　　处：《Journal of Mathematical Study》2016年第1期72-81,共10页数学研究（英文）

基　　金：This work was in part supported by NSFC(Grant No.11371328,No.11271334);by the Natural Science Foundation of Zhejiang Province,China(Grant No.LY15A010011).

摘　　要：For two simple connected graphs G_(1) and G_(2),we introduce a new graph operation called the total corona G_(1)⊛G_(2) on G_(1) and G_(2) involving the total graph of G_(1).Subsequently,the adjacency(respectively,Laplacian and signless Laplacian)spectra of G_(1)⊛G_(2) are determined in terms of these of a regular graph G_(1) and an arbitrary graph G_(2).As applications,we construct infinitely many pairs of adjacency(respectively,Laplacian and signless Laplacian)cospectral graphs.Besides we also compute the number of spanning trees of G_(1)⊛G_(2).

关 键 词：Adjacency matrix Laplacian matrix signless Laplacian matrix SPECTRUM total corona 

分 类 号：O15[理学—数学]