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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Let B be a weighted generalized Bethe tree of k levels (k > 1) in which nj is the number of vertices at the level k j +1 (1  jk). Let   {1,2,...,k 1} and F= {Gj : j 2 }, where Gj is a prescribed weighted graph on each set of children of B at the level k j+1. In this paper, the eigenvalues of a block symmetric tridiagonal matrix of order n1 +n2 +···+nk are characterized as the eigenvalues of symmetric tridiagonal matrices of order j, 1  jk, easily constructed from the degrees of the vertices, the weights of the edges, and the eigenvalues of the matrices associated to the family of graphs F. These results are applied to characterize the eigenvalues of the Laplacian matrix, including their multiplicities, of the graph B (F) obtained from B and all the graphs in F = {Gj : j 2 }; and also of the signless Laplacian and adjacency matrices whenever the graphs of the family F are regular.

Spectra of weighted rooted graphs having prescribed subgraphs at some levels