Computing the Laplacian spectrum of linear octagonal-quadrilateral networks and its applications
Combinatorics
2019-05-28 v1
Abstract
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.
Keywords
Cite
@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}
}
Comments
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