Abstract

<abstract><p>As a powerful tool for describing and studying the properties of networks, the graph spectrum analyses and calculations have attracted substantial attention from the scientific community. Let $ C_{n} $ represent linear crossed phenylenes. Based on the Laplacian (normalized Laplacian, resp.) polynomial of $ C_{n} $, we first investigated the Laplacian (normalized Laplacian, resp) spectrum of $ C_{n} $ in this paper. Furthermore, the Kirchhoff index, multiplicative degree-Kirchhoff, index and complexity of $ C_{n} $ were obtained through the relationship between the roots and the coefficients of the characteristic polynomials. Finally, it was found that the Kirchhoff index and multiplicative degree-Kirchhoff index of $ C_{n} $ were approximately one quarter of their Wiener index and Gutman index, respectively.</p></abstract>

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call