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

The present-day trend of the numerical coding of chemical structures with topological indices (TIs) has established quite successful in medicinal chemistry and bioinformatics. This strategy provides the annotation, comparison, rapid collection, mining, and retrieval of chemical structures within large databases. Afterward, TIs can be used to look for quantitative structure-activity relationships and quantitative structure-property relationships, which are models that associate chemical structure with biological activity. In these analyses, degree-based TIs have secured a significant place among the different types of descriptors because of the ease of generation and the momentum with which these computations can be executed. In this paper, we compute the lower and upper bounds of the first, second, and third Zagreb, the first and the second multiple Zagreb, the geometric-arithmetic, the general sum connectivity, the general Randi<inline-formula> <tex-math notation="LaTeX">$\acute {c}$ </tex-math></inline-formula>, the atom-bond connectivity, the augmented Zagreb, and the harmonic indices of the corona product of <inline-formula> <tex-math notation="LaTeX">$F$ </tex-math></inline-formula>-sum of connected graphs in the form of their factor graphs by applying combinatorial inequalities.

ieee access

Bounds on Topological Descriptors of the Corona Product of &lt;inline-formula&gt; &lt;tex-math notation="LaTeX"&gt;$F$ &lt;/tex-math&gt; &lt;/inline-formula&gt;-Sum of Connected Graphs