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$ be a connected graph. The edge revised Szeged index of $G$ is definedas $Sz^{\ast}_{e}(G)=\sum\limits_{e=uv\inE(G)}(m_{u}(e|G)+\frac{m_{0}(e|G)}{2})(m_{v}(e|G)+\frac{m_{0}(e|G)}{2})$, where$m_{u}(e|G)$ (resp., $m_{v}(e|G)$) is the number of edges whose distance tovertex $u$ (resp., $v$) is smaller than the distance to vertex $v$ (resp.,$u$), and $m_{0}(e|G)$ is the number of edges equidistant from both ends of$e$. In this paper, we give the minimal and the second minimal edge revisedSzeged index of cacti with order $n$ and $k$ cycles, and all the graphs thatachieve the minimal and second minimal edge revised Szeged index areidentified.

On extremal cacti with respect to the edge revised Szeged index