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

A set D of vertices in a graph  G  ( V ,  E ) is a dominating set of  G , if every vertex in  V - D  is adjacent to at least one vertex in D. If  V - D  contains a dominatingset  D ’  of  G  then  D ’  is called an inverse dominating set with respect to  D . In this paper we have established some theorems and properties of the inverse domination number to the transformation of path related graphs.

Inverse Domination To The Transformation Of Path Related Graphs