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

Here, we represent a general hypergraph by a matrix and study its spectrum.We extend the definition of equitable partition and joining operation forhypergraphs, and use those to compute eigenvalues of different hypergraphs. Wederive the characteristics polynomial of a complete $m$-uniform $m$-partitehypergraph $K^m_{n_1,n_2,\dots,n_m}$. Studying edge corona of hypergraphs wefind the complete spectrum of $s$-loose cycles $C^m_{L(s;n)}$ for $m \geq 2s+1$and the characteristics polynomial of a $s$-loose paths $P^{(m)}_{L(s;n)}$.Some of the eigenvalues of $P^{(m)}_{L(s;n)}$ are also derived. Moreover, usingvertex corona, we show how to generate infinitely many pairs of non-isomorphicco-spectral hypergraphs.

Joins of Hypergraphs and Their Spectra