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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The M-polynomial of a graph G is defined as \(\sum _{i\le j} m_{i,j}(G)x^iy^j\), where \(m_{i,j}(G)\), \(i,j\ge 1\), is the number of edges uv of G such that \(\{d_v(G), d_u(G)\} = \{i,j\}\). Knowing the M-polynomial, formulas for bond incident degree indices (an important subclass of degree-based topological indices) can be obtained by means of specific operators defined on differentiable functions in two variables. This is illustrated on three infinite families of Bethe cacti. Gutman’s approach for the computation of the coefficients of the M-polynomial is also recalled and an extension of it is given. This extension is used to determine the M-polynomial of a two-parameter infinite family of lattice graphs.

M-polynomial revisited: Bethe cacti and an extension of Gutman’s approach