用户名: 密码: 验证码:
Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs
详细信息    查看全文
文摘
Consider two graphs class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si4.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=eee5701ac9c753f66fe6fe84cc5c7130" title="Click to view the MathML source">Gclass="mathContainer hidden">class="mathCode">G and class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si5.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=da62f961893e35e99b6a2c50005da088" title="Click to view the MathML source">Hclass="mathContainer hidden">class="mathCode">H. Let class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si6.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=2d5758bd7ec7237fdff7c4c888a56daf" title="Click to view the MathML source">Hk[G]class="mathContainer hidden">class="mathCode">Hk[G] be the lexicographic product of class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si7.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=10a23dbf68c5c1bd2854afdcdcafed67" title="Click to view the MathML source">Hkclass="mathContainer hidden">class="mathCode">Hk and class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si4.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=eee5701ac9c753f66fe6fe84cc5c7130" title="Click to view the MathML source">Gclass="mathContainer hidden">class="mathCode">G, where class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si7.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=10a23dbf68c5c1bd2854afdcdcafed67" title="Click to view the MathML source">Hkclass="mathContainer hidden">class="mathCode">Hk is the lexicographic product of the graph class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si5.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=da62f961893e35e99b6a2c50005da088" title="Click to view the MathML source">Hclass="mathContainer hidden">class="mathCode">H by itself class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si11.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=6898e1c6a70851437d3533143284fafe" title="Click to view the MathML source">kclass="mathContainer hidden">class="mathCode">k times. In this paper, we determine the spectrum of class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si6.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=2d5758bd7ec7237fdff7c4c888a56daf" title="Click to view the MathML source">Hk[G]class="mathContainer hidden">class="mathCode">Hk[G] and class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si7.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=10a23dbf68c5c1bd2854afdcdcafed67" title="Click to view the MathML source">Hkclass="mathContainer hidden">class="mathCode">Hk when class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si4.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=eee5701ac9c753f66fe6fe84cc5c7130" title="Click to view the MathML source">Gclass="mathContainer hidden">class="mathCode">G and class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si5.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=da62f961893e35e99b6a2c50005da088" title="Click to view the MathML source">Hclass="mathContainer hidden">class="mathCode">H are regular and the Laplacian spectrum of class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si6.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=2d5758bd7ec7237fdff7c4c888a56daf" title="Click to view the MathML source">Hk[G]class="mathContainer hidden">class="mathCode">Hk[G] and class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si7.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=10a23dbf68c5c1bd2854afdcdcafed67" title="Click to view the MathML source">Hkclass="mathContainer hidden">class="mathCode">Hk for class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si4.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=eee5701ac9c753f66fe6fe84cc5c7130" title="Click to view the MathML source">Gclass="mathContainer hidden">class="mathCode">G and class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X16302382&_mathId=si5.gif&_user=111111111&_pii=S0012365X16302382&_rdoc=1&_issn=0012365X&md5=da62f961893e35e99b6a2c50005da088" title="Click to view the MathML source">Hclass="mathContainer hidden">class="mathCode">H arbitrary. Particular emphasis is given to the least eigenvalue of the adjacency matrix in the case of lexicographic powers of regular graphs, and to the algebraic connectivity and the largest Laplacian eigenvalues in the case of lexicographic powers of arbitrary graphs. This approach allows the determination of the spectrum (in case of regular graphs) and Laplacian spectrum (for arbitrary graphs) of huge graphs. As an example, the spectrum of the lexicographic power of the Petersen graph with the googol number (that is, 10100 ) of vertices is determined. The paper finishes with the extension of some well known spectral and combinatorial invariant properties of graphs to its lexicographic powers.

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

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

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