摘要
一个图的谱定义为它的邻接矩阵的所有特征值的集合。本文假定C_(n)和圈C_(m)为不相交的两个圈,构造新图coronaC_(n)oC_(m),应用矩阵分块和Kronecker矩阵乘法运算得到其谱。同时计算出圈C_(n)的angle矩阵B(C_(n))和main angle矩阵b(C_(n))。
The spectrum of a graph is defined as the set of all eigenvalues of its adjacency matrix.This paper assumes that C_(n) and cycle C_(m) are disjoint cycles,constructs a new graph corona C_(n)oC_(m),and obtains its spectrum by matrix partition and Kronecker matrix multiplication.In addition,the angle matrix B(C_(n)) and the main angle matrix b(C_(n)) of the cycle C_(n) are calculated.
作者
蔡永
俞颖
CAI Yong;YU Ying(School of Information Engineering,Jingdezhen University,Jingdezhen 333400,Jiangxi Province,China;Jingdezhen Second Primary School,Jingdezhen 333000,Jiangxi Province,China)
出处
《景德镇学院学报》
2022年第6期5-8,共4页
Journal of JingDeZhen University
基金
景德镇市软科学指导计划项目(景科字[2021]62号20211RKX008)。