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 revised edge Szeged indexof a graph  G  is defined aswhereandare, respectively, the number of edges of  G  lying closer to vertex  u  than to vertex  v  and the number of edges of  G  lying closer to vertex  v  than to vertex  u , andis the number of edges equidistant to  u  and  v . In the paper, we show the sharp lower bound of revised edge Szeged index regarding bicyclic graphs. Moreover, all extremal graphs are characterized.

On minimum revised edge Szeged index of bicyclic graphs