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

Adjacency between two vertices in graphs or hypergraphs is a pairwiserelationship. It is redefined in this article as 2-adjacency. In generalhypergraphs, hyperedges hold for $n$-adic relationship. To keep the $n$-adicrelationship the concepts of $k$-adjacency and e-adjacency are defined. Ingraphs 2-adjacency and e-adjacency concepts match, just as $k$-adjacency ande-adjacency do for $k$-uniform hypergraphs. For general hypergraphs theseconcepts are different. This paper also contributes in a uniformization processof a general hypergraph to allow the definition of an e-adjacency tensor,viewed as a hypermatrix, reflecting the general hypergraph structure. Thissymmetric e-adjacency hypermatrix allows to capture not only the degree of thevertices and the cardinality of the hyperedges but also makes a full separationof the different layers of a hypergraph.

Adjacency and Tensor Representation in General Hypergraphs Part 1: e-adjacency Tensor Uniformisation Using Homogeneous Polynomials