Complete split graph determined by its (signless) Laplacian spectrum
详细信息    查看全文
文摘
A complete split graph 16000044&_mathId=si1.gif&_user=111111111&_pii=S0166218X16000044&_rdoc=1&_issn=0166218X&md5=febd683cc1c57a97455d9be14ff128b6">View the MathML source16000044-si1.gif">, is a graph on 16000044&_mathId=si2.gif&_user=111111111&_pii=S0166218X16000044&_rdoc=1&_issn=0166218X&md5=7fc766d724d5f9eae4e72ee48c5d9316" title="Click to view the MathML source">n vertices consisting of a clique on 16000044&_mathId=si3.gif&_user=111111111&_pii=S0166218X16000044&_rdoc=1&_issn=0166218X&md5=de55232bd14c6b6843b2c487657b34be" title="Click to view the MathML source">n−α vertices and an independent set on the remaining 16000044&_mathId=si4.gif&_user=111111111&_pii=S0166218X16000044&_rdoc=1&_issn=0166218X&md5=ddce219cb98226441669bac84304a1ea">View the MathML source16000044-si4.gif"> vertices in which each vertex of the clique is adjacent to each vertex of the independent set. In this paper, we prove that 16000044&_mathId=si1.gif&_user=111111111&_pii=S0166218X16000044&_rdoc=1&_issn=0166218X&md5=febd683cc1c57a97455d9be14ff128b6">View the MathML source16000044-si1.gif"> is determined by its Laplacian spectrum when 16000044&_mathId=si6.gif&_user=111111111&_pii=S0166218X16000044&_rdoc=1&_issn=0166218X&md5=d15e7801b1a85b20ab068252f1f7992c" title="Click to view the MathML source">1≤α≤n−1, and 16000044&_mathId=si1.gif&_user=111111111&_pii=S0166218X16000044&_rdoc=1&_issn=0166218X&md5=febd683cc1c57a97455d9be14ff128b6">View the MathML source16000044-si1.gif"> is also determined by its signless Laplacian spectrum when 16000044&_mathId=si6.gif&_user=111111111&_pii=S0166218X16000044&_rdoc=1&_issn=0166218X&md5=d15e7801b1a85b20ab068252f1f7992c" title="Click to view the MathML source">1≤α≤n−1 and 16000044&_mathId=si9.gif&_user=111111111&_pii=S0166218X16000044&_rdoc=1&_issn=0166218X&md5=78486213c03983091dc72256a77ba944" title="Click to view the MathML source">α≠3.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700