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

Let G = (V;E) be a simple connected graph. The sets of vertices and edges of G are denoted byV = V(G) and E = E(G), respectively. In such a simple molecular graph, vertices represent atoms andedges represent bonds. The distance between the vertices u and v in V(G) of graph G is the number ofedges in a shortest path connecting them, we denote by d(u,v). In graph theory, we have manyinvariant polynomials for a graph G. In this research, we computing the Schultz polynomial, ModifiedSchultz polynomial, Hosoya polynomial and their topological indices of a Hydrocarbon molecule, thatwe call “Coronene Polycyclic Aromatic Hydrocarbons”.

Schultz and Modified Schultz Polynomials of Coronene Polycyclic Aromatic Hydrocarbons