首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一些拉普拉斯谱确定的图
引用本文:王玉洁,何常香.一些拉普拉斯谱确定的图[J].上海理工大学学报,2016,38(3):223-229.
作者姓名:王玉洁  何常香
作者单位:上海理工大学理学院, 上海 200093;上海理工大学理学院, 上海 200093
基金项目:国家自然科学基金资助项目(11201303);上海市自然科学基金资助项目(12ZR1420300)
摘    要:如果与图G同拉普拉斯谱的图都与图G同构,则称图G由它的拉普拉斯谱确定.给出了三类基图为B(P_3,P_3,P_3)(即连接2点的3条长为2的内不交的路)的连通二部双圈图类H(n;n_1),H(n;n_1,n_2)和B(n;n_1,n_2).证明了H(n;n1),H(n;n_1,n_2)和B(n;n_1,n_2)是拉普拉斯谱确定的,且与完全图经并接运算后所得图也是拉普拉斯谱确定的.

关 键 词:二部双圈图  拉普拉斯矩阵  拉普拉斯谱确定
收稿时间:2015/12/30 0:00:00

Some Graphs Determined by Their Laplacian Spectrum
WANG Yujie and HE Changxiang.Some Graphs Determined by Their Laplacian Spectrum[J].Journal of University of Shanghai For Science and Technology,2016,38(3):223-229.
Authors:WANG Yujie and HE Changxiang
Institution:College of Science, University of Shanghai for Science and Technology, Shanghai 200093, China;College of Science, University of Shanghai for Science and Technology, Shanghai 200093, China
Abstract:A graph is said to be determined by its Laplacian spectrum, if there is no other non-isomorphic graph with the same Laplacian spectrum.Three types of bicyclic bipartite graphs H(n;n1), H(n;n1, n2) and B(n;n1, n2), which all have the base of B(P3, P3, P3) (three disjoint paths of length 2 between two vertices) were studlied.It is proved that the graphs are determined by their Laplacian spectrum, and the graphs obtained by the join of complete graphs and the above three type bicyclic graphs are also determined by their Laplacian spectrum.
Keywords:bipartite bicyclic graph  Laplacian matrix  determination by the Laplacian spectrum
本文献已被 CNKI 等数据库收录!
点击此处可从《上海理工大学学报》浏览原始摘要信息
点击此处可从《上海理工大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号