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

Zagreb indices and their modified versions of a molecular graph originate from many practical problems such as two dimensional quantitative structure-activity (2D QSAR) and molecular chirality. Nowadays, they have become important invariants which can be used to characterize the properties of graphs from different aspects. LetVn (orEn respectively) be a set of graphs of n vertices with vertex connectivity (or edge connectivity respectively) at most k. In this paper, we explore some properties of the modified first and second multiplicative Zagreb indices of graphs inVn andEn. By using analytic and combinatorial tools, we obtain some sharp lower and upper bounds for these indices of graphs in Vn and En. In addition, the corresponding extremal graphs which attain the lower or upper bounds are characterized. Our results enrich outcomes on studying Zagreb indices and the methods developed in this paper may provide some new tools for investigating the values on modified multiplicative Zagreb indices of other classes of graphs.

Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k