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 variation of the Randi\'c index $ R'(G) $ of a graph $G$ is defined by\$R(G) = \sum_{uv \in E(G)}\frac 1{\max \{d(u) d(v)\}}$, where $d(u)$ is thedegree of vertex $u$ and the summation extends over all edges $uv$ of $G$. Let$G(k,n)$ be the set of connected simple $n$-vertex graphs with minimum vertexdegree $k$. In this paper we found in $G(k,n)$ graphs for which the variationof the Randi\'c index attains its minimum value.  When $k \leq \frac n2$ the extremal graphs are complete split graphs$K_{k,n-k}^*$, which only vertices of two degrees, i.e. degree $k$ and degree$n-1$, and the number of vertices of degree $k$ is $n-k$, while the number ofvertices of degree $n-1$ is $k$. For $k \geq \frac n2$ the extremal graphs havealso vertices of two degrees $k$ and $n-1$, and the number of vertices ofdegree $k$ is $\frac n2$. Further, we generalized results for graphs with givenmaximum degree.

The variation of the Randic index with regard to minimum and maximum degree