首页> 外文期刊>Journal of Discrete Mathematical Sciences and Cryptography >Which multicone graphs K_n?K_m are determined by their signless Laplacian spectrum? (The proof of a conjecture)
【24h】

Which multicone graphs K_n?K_m are determined by their signless Laplacian spectrum? (The proof of a conjecture)

机译:哪个多级图形k_n?k_m由其无靶拉瓦普拉斯谱决定? (猜想的证明)

获取原文
获取原文并翻译 | 示例
           

摘要

A multicone graph is defined to be the join of a clique and a regular graph. Let K_m and K_n denote a complete graph on m vertices and the complement of a complete graph on n vertices, respectively. In [X. Liu and P. Lu, Signless Laplacian spectral characterization of some joins, Electron. J. Linear Algebra 30.1 (2015)], it have been conjectured that the multicone graphs K_n ?K_m are determined by their signless Laplacian spectrum. In this short note, we prove this conjecture for n ≠ 3.
机译:多个图形被定义为Clique和常规图形的连接。 设k_m和k_n分别表示m顶点上的完整图,分别在n顶点上的完整图的补充。 在[X. 刘和P. Lu,一些加入,电子的无数拉普拉斯光谱表征。 J.线性代数30.1(2015)],已经猜测了多级图K_N?K_M由其无特征拉普拉斯谱决定。 在这个简短的注意事项中,我们证明了这个猜想n≠3。

著录项

相似文献

  • 外文文献
  • 中文文献
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号