摘要
图的零化度是其谱中零特征值的重数,让Kt是t(t≥3)阶完全图,T是与Kt不交的树集.设Ti∈T,ui∈Ti,用Ot,m表示ui与Kt的一个点连接得到的图类(0≤i≤m).令Ot,m^n{Ot,m:|Ot,m|=n}.首先确定了Ot,m的零化度集,并根据其零化度对Ot,m^n中图的所有点进行了分类.
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum.Let Kt be a complete graph of order t(t≥3)and T be a set of trees disjoint with Kt.If Ti∈T and ui∈Ti,then we denote by Ot,m the graph obtained from Kt and Ti by joining ui to a vertex of Kt(0≤i≤m).Let Ot,m^n={Ot,m:|Ot,m|=n}.In this paper,we obtain the nullity set of Ot,m and classify all vertices of graphs in Ot,m^n in terms of their nullities.
作者
冯小芸
朱俊杰
朱菲
王国平
Feng Xiaoyun;Zhu Junjie;Zhu Fei;Wang Guoping(School of Mathematical Sciences,Xinjiang Normal University,Urumqi,Xinjiang 830017,China;Department of Mathematics,Changji College,Changji,Xinjiang 831100,China;Department of Mathematics,XinjiangWater Resources and Hydropower School,Urumqi,Xinjiang 830013,China)
出处
《伊犁师范学院学报（自然科学版）》
2020年第1期8-13,共6页
Journal of Yili Normal University：Natural Science Edition
关键词
谱
零化度
Ot
m^n中的图
spectrum
the nullity
the graphs in Ot,m^n
