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 status of a vertex $u$ in a connected graph $G$, denoted by$\sigma_G(u)$, is defined as the sum of the distances between $u$ and all othervertices of a graph $G$. The first and second status connectivity indices of agraph $G$ are defined as $S_{1}(G) = \sum_{uv \in E(G)}[\sigma_G(u)+\sigma_G(v)]$ and $S_{2}(G) = \sum_{uv \in E(G)}\sigma_G(u)\sigma_G(v)$respectively, where $E(G)$ denotes the edge set of $G$. In this paper we havedefined the first and second status co-indices of a graph $G$ as$\overline{S_{1}}(G) = \sum_{uv \notin E(G)}[\sigma_G(u)+ \sigma_G(v)]$ and$\overline{S_{2}}(G) = \sum_{uv \notin E(G)}\sigma_G(u)\sigma_G(v)$respectively. Relations between status connectivity indices and statuscoindices are established. Also these indices are computed for intersectiongraph, hypercube, Kneser graph and achiral polyhex nanotorus.

Status connectivity indices and co-indices of graphs and its computation to intersection graph, hypercube, Kneser graph and achiral polyhex nanotorus