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

Let $G$ be a graph and let $m_{ij}(G)$, $i,j\ge 1$, be the number of edges$uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. The {\em $M$-polynomial}of $G$ is introduced with $\displaystyle{M(G;x,y) = \sum_{i\le j}m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can beroutinely computed from the polynomial, thus reducing the problem of theirdetermination in each particular case to the single problem of determining the$M$-polynomial. The new approach is also illustrated with examples.

M-Polynomial and Degree-Based Topological Indices