线性八角-四边形网络的拉普拉斯谱计算及其应用
组合数学
2019-05-28 v1
摘要
令 Ln 表示线性八角-四边形网络。本文旨在首先基于 Ln 的拉普拉斯多项式研究其拉普拉斯谱。然后，利用多项式系数与根之间的关系，确定其基尔霍夫指数与复杂度。
引用
@article{arxiv.1905.10503,
title = {Computing the Laplacian spectrum of linear octagonal-quadrilateral networks and its applications},
author = {Jia-Bao Liu and Zhi-Yu Shi and Ying-Hao Pan and Jinde Cao and M. Abdel-Aty and Udai Al-Juboori},
journal= {arXiv preprint arXiv:1905.10503},
year = {2019}
}
备注
Let Ln denote linear octagonal-quadrilateral networks. In this paper, we aim to firstly investigate the Laplacian spectrum on the basis of Laplacian polynomial of Ln. Then, by applying the relationship between the coefficients and roots of the polynomials, the Kirchhoff index and the complexity are determined