English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A network is defined as an abstract structure that consists of nodes that are connected by links. In this paper, we study two types of rounded networks(resp.,). By using the recursive relation, we obtain all the eigenvalues and their multiplicities with regards to the associated Laplacian matrix. Meanwhile, we utilize the corresponding relationship between the roots and the coefficients of the characteristic polynomial. Based on these relationships, we obtain the analytical expressions for the sum of the reciprocals of all nonzero Laplacian eigenvalues. By the decomposition theorem of Laplacian polynomial, we obtained an explicit closed-form formula of the Kirchhoff index for. As an application of the Laplacian spectra, we reduce the number of spanning trees and the global mean-first passage time for. Furthermore, we show that the Kirchhoff index ofis approximately toof its Wiener index. In view of our obtained results, all the corresponding results are considered for.

Spectral analysis of three invariants associated to random walks on rounded networks with 2 n -pentagons