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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

<div style="mso-element: frame; mso-element-frame-width: 399.0pt; mso-element-wrap: auto; mso-element-anchor-vertical: page; mso-element-anchor-horizontal: page; mso-element-left: 112.35pt; mso-element-top: 470.75pt; mso-height-rule: exactly;">We investigate some new results for strongly multiplicative labeling of graph. We prove that the graph obtained by arbitrary supersubdivision of tree $T$, grid graph $P_{n}imes P_{m}$, complete bipartite graph $K_{m,n}$, $C_{n}odot P_{m}$ and one-point union of $m$ cycle of length $n$ are strongly multiplicative.</div

Strongly Multiplicative Labeling in the Context of Arbitrary Supersubdivision