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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We study the concept of strong equality of majority domination parameters. Let 1 P and 2 P be properties of vertex subsets of a graph, and assume that every subset of ( ) V G with property 2 P also has property 1 P . Let 1( ) G  and 2 ( ) G  , respectively, denote the minimum cardinalities of sets with properties 1 P and 2 P , respectively. Then 1 2 ( ) ( ) G G    . If 1 2 ( ) ( ) G G    and every 1( ) G  -set is also a 2 ( ) G  -set

Strong Equality of MAJORITY Domination Parameters