Applications of Laplacian spectra for n-prism networks
详细信息 查看全文
- 作者：Jia-Bao Liua ; b ; liujiabaoad@163.com" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae ; Jinde Caoc ; d ; jdcao@seu.edu.cn" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae ; Abdulaziz Alofid ; aalofi1@kau.edu.sa" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae ; Abdullah AL-Mazrooeid ; e ; aealmazrooei@kau.edu.sa" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae ; A. Elaiwd ; a_m_elaiw@yahoo.com" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae
- 关键词：Laplacian spectra ; n-Prism networks ; Spanning tree ; Mean first-passage time ; Complex networks
- 刊名：Neurocomputing
- 出版年：2016
- 出版时间：19 July 2016
- 年：2016
- 卷：198
- 期：Complete
- 页码：69-73
- 全文大小：538 K
文摘
- •
We propose the structure of n-prism networks.
- •
We calculate the Laplacian spectra of n-prism networks.
- •
We deduce expressions for product and sum of reciprocals of all nonzero Laplacian-eigenvalues.
- •
Kirchhoff index, GMFPT, average path length and the number of spanning trees are obtained.