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

The concept of zero forcing is extended from graphs to uniform hypergraphs inanalogy with the way zero forcing was defined as an upper bound for the maximumnullity of the family of symmetric matrices whose nonzero pattern of entries isdescribed by a given graph: A family of symmetric hypermatrices is associatedwith a uniform hypergraph and zeros are forced in a null vector. The value ofthe hypergraph zero forcing number and maximum nullity are determined forvarious families of uniform hypergraphs and the effects of several graphoperations on the hypergraph zero forcing number are determined. The hypergraphzero forcing number is compared to the infection number of a hypergraph and theiteration process in hypergraph power domination.

Zero forcing and maximum nullity for hypergraphs