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 graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions. In this paper for a graph G(V,E) each of the vertices v ∈V (G) are assigned by pronic numbers. In this paper, we investigate the pronic heron mean labeling on special cases of generalized Petersen graph P(n,k). Also we described an algorithm to label the vertices for the pronic heron mean labeling for certain disconnected graphs.

Pronic Heron Mean labeling on special cases of generalized Peterson graph $ P(n,k) $ and disconnected graphs