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

Given a (molecular) graph, the first multiplicative Zagreb index Π 1 is considered to be the product of squares of the degree of its vertices, while the second multiplicative Zagreb index Π 2 is expressed as the product of endvertex degree of each edge over all edges. We consider a set of graphs G n , k having n vertices and k cut edges, and explore the graphs subject to a number of cut edges. In addition, the maximum and minimum multiplicative Zagreb indices of graphs in G n , k are provided. We also provide these graphs with the largest and smallest Π 1 ( G ) and Π 2 ( G ) in G n , k .

Maximizing and Minimizing Multiplicative Zagreb Indices of Graphs Subject to Given Number of Cut Edges