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

The Wiener index, $W(G)$, of a connected graph $G$ is the sum of distancesbetween its vertices. In 2021, Akhmejanova et al. posed the problem of findinggraphs $G$ with large $R_m(G)= |\{v\in V(G)\,|\,W(G)-W(G-v)=m \in \mathbb{Z}\}|/ |V(G)|$. It is shown that there is a graph $G$ with $R_m(G) > 1/2$ for anyinteger $m \ge 0$. In particular, there is a regular graph of even degree withthis property for any odd $m \ge 1$. The proposed approach allows to constructnew families of graphs $G$ with $R_0(G) \rightarrow 1/2$ when the order of $G$increases.

Some results on the Wiener index related to the \v{S}olt\'{e}s problem of graphs