The spectral characterization of butterfly-like graphs
详细信息    查看全文
文摘
Let 024379516304633&_mathId=si1.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=2be55cdbb5ee9718d33c6234249e6888" title="Click to view the MathML source">a(k)=(a1,a2,…,ak) be a sequence of positive integers. A butterfly-like graph  024379516304633&_mathId=si121.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=5f2dba172b36c82f74f2d467b1c8f852" title="Click to view the MathML source">Wp(s);a(k) is a graph consisting of s  024379516304633&_mathId=si3.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=a0b4d7bd2bab5ced562d0d242091046e" title="Click to view the MathML source">(≥1) cycle of lengths 024379516304633&_mathId=si4.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=55be786f5897a1a164de5b1d936dbdcb" title="Click to view the MathML source">p+1, and k  024379516304633&_mathId=si3.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=a0b4d7bd2bab5ced562d0d242091046e" title="Click to view the MathML source">(≥1) paths 024379516304633&_mathId=si5.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=3b6d2de856f3932200bf00232d4fc73f" title="Click to view the MathML source">Pa1+1, 024379516304633&_mathId=si6.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=d13fb0e4451ece43247b9166206eacb3" title="Click to view the MathML source">Pa2+1, …, 024379516304633&_mathId=si7.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=b2bf07de72f0f0f850c565e0c99fc6d5" title="Click to view the MathML source">Pak+1 intersecting in a single vertex. The girth of a graph G is the length of a shortest cycle in G. Two graphs are said to be A-cospectral if they have the same adjacency spectrum. For a graph G, if there does not exist another non-isomorphic graph H such that G and H share the same Laplacian (respectively, signless Laplacian) spectrum, then we say that G   is 024379516304633&_mathId=si289.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=c5c028a6685a064796dca3aaccf0e6e0" title="Click to view the MathML source">L−DS (respectively, 024379516304633&_mathId=si288.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=650d83b413c9054009cbeab84ed0c51c" title="Click to view the MathML source">Q−DS). In this paper, we firstly prove that no two non-isomorphic butterfly-like graphs with the same girth are A-cospectral, and then present a new upper and lower bounds for the i  -th largest eigenvalue of 024379516304633&_mathId=si10.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=e70688745a22904a0fec00e028f806be" title="Click to view the MathML source">L(G) and 024379516304633&_mathId=si11.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=454e1569a1e2ff8ae32ee7563cd97472" title="Click to view the MathML source">Q(G), respectively. By applying these new results, we give a positive answer to an open problem in Wen et al. (2015) [17] by proving that all the butterfly-like graphs 024379516304633&_mathId=si12.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=8f2be4db2a5447060a7242f531c7525f" title="Click to view the MathML source">W2(s);a(k) are both 024379516304633&_mathId=si288.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=650d83b413c9054009cbeab84ed0c51c" title="Click to view the MathML source">Q−DS and 024379516304633&_mathId=si289.gif&_user=111111111&_pii=S0024379516304633&_rdoc=1&_issn=00243795&md5=c5c028a6685a064796dca3aaccf0e6e0" title="Click to view the MathML source">L−DS.

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

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

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