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

Graph domination by vertices is finding a subset  D  from the vertex set  V ( G ), “in a graph  G  such that  D  is a dominating set if every vertex in set  V – D  is adjacent to at least one vertex in set  D ”, In this paper,  D (G,i) when  G  is a composition of complete graph K r  and star graph  S m , is constructed where “D(G,i), is the family of all dominating sets of a graph G with cardinality  i  and  d ( G,i ) = | D ( G, i )|”. A recursive formula for  d ( K r [ S m ],  i ) is obtained. The domination polynomial of graph  K r [ S m ] is determined by using this recursive formula.

Domination Polynomial of the Composition of Complete Graph and Star Graph