期刊
NEUROCOMPUTING
卷 198, 期 -, 页码 69-73出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.neucom.2015.06.109
关键词
Laplacian spectra; n-Prism networks; Spanning tree; Mean first-passage time; Complex networks
In this paper, the properties of the Laplacian matrices for the n-prism networks are investigated. We calculate the Laplacian spectra of n-prism graphs which are both planar and polyhedral. In particular, we derive the analytical expressions for the product and the sum of the reciprocals of all nonzero Laplacian eigenvalues. Moreover, these results are used to handle various problems that often arise in the study of networks including Kirchhoff index, global mean-first passage time, average path length and the number of spanning trees. These consequences improve and extend the earlier results. (C) 2016 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据