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

Let $G=(V,E)$ be a simple connected graph with vertex set $V(G)$ and edge set$E(G)$. The third atom-bond connectivity index, $ABC_3$ index, of $G$ isdefined as $ABC_3(G)=\sum\limits_{uv\inE(G)}\sqrt{\frac{e(u)+e(v)-2}{e(u)e(v)}}$, where eccentricity $e(u)$ is thelargest distance between $u$ and any other vertex of $G$, namely$e(u)=\max\{d(u,v)|v\in V(G)\}$. This work determines the maximal $ABC_3$ indexof unicyclic graphs with any given girth and trees with any given diameter, andcharacterizes the corresponding graphs.

On the third ABC index of trees and unicyclic graphs