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

An $r$-uniform supertree is a connected and acyclic hypergraph of which eachedge has $r$ vertices, where $r\geq 3$. We propose the concept of matchingenergy for an $r$-uniform hypergraph, which is defined as the sum of theabsolute value of all the eigenvalues of its matching polynomial. With the aidof the matching polynomial of an $r$-uniform supertree, three pairs of$r$-uniform supertrees with the same spectral radius and the same matchingenergy are constructed, and two infinite families of $r$-uniform supertreeswith the same spectral radius and the same matching energy are characterized.Some known results about the graphs with the same spectra regarding to theiradjacency matrices can be naturally deduced from our new results.

Constructing the $r$-uniform supertrees with the same spectral radius and matching energyv