基于拉普拉斯谱确定的两类树

发布时间：2018-03-27 05:29

本文选题：图谱　切入点：同谱图　出处：《运筹学学报》2017年01期

【摘要】：设图G是简单连通图.如果任何一个与图G关于拉普拉斯矩阵同谱的图,都与图G同构,称图G可由其拉普拉斯谱确定.定义了树Y_n和树F(2,n,1)两类特殊结构的树.利用同谱图线图的特点,证明了树Y_n和树F(2,n,1)可由其拉普拉斯谱确定.
[Abstract]:Let G be a simple connected graph. If any graph is of the same spectrum as the graph G with respect to the Laplace matrix, it is isomorphic to the graph G. The symmetric graph G can be determined by its Laplace spectrum. The trees with two special structures of tree Ys n and tree F 1 are defined. By using the characteristics of the same spectral graph, it is proved that the tree Y n and the tree F 1 can be determined by their Laplace spectra.
【作者单位】：上海大学理学院数学系;武警政治学院;
【基金】：国家自然科学基金(No.11371242)
【分类号】：O157.5

【相似文献】