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 digraph and $r(G)$ be its rank. Many interesting results on therank of an undirected graph appear in the literature, but not much informationabout the rank of a digraph is available. In this article, we study the rank ofa digraph using the ranks of its blocks. In particular, we define classes ofdigraphs, namely $r_2$-digraph, and $r_0$-digraph, for which the rank can beexactly determined in terms of the ranks of subdigraphs of the blocks.Furthermore, the rank of directed trees, simple biblock graphs, and some simpleblock graphs are studied.

Rank of weighted digraphs with blocks