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 $S(G^{\sigma})$ be the skew-adjacency matrix of the oriented graph$G^{\sigma}$, which is obtained from a simple undirected graph $G$ by assigningan orientation $\sigma$ to each of its edges. The skew energy of an orientedgraph $G^{\sigma}$ is defined as the sum of absolute values of all eigenvaluesof $S(G^{\sigma})$. For any positive integer $d$ with $3\leq d\leq n-3$, wedetermine the graph with minimal skew energy among all oriented bicyclic graphsthat contain no vertex disjoint odd cycle of lengths $s$ and $l$ with$s+l\equiv 2(mod 4)$ on $n$ vertices with a given diameter $d$.

Minimal Skew energy of oriented bicyclic graphs with a given diameter