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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Let G is a connected simple graph and V(G) = {v1, v2, ..., vp} is vertex set of G. The distance matrix of G is a matrix D(G) = [d ij ] of order p where [d ij ] = d(v i , v j ) is distance between v i and v j in G. The set of all eigenvalues of matrix D(G) together with their corresponding multiplicities is named the distance spectrum of G and denoted by spec D (G). The distance energy of G is ${E}_{D}(G)={\sum }_{i=1}^{p}|{\lambda }_{i}|$, where λi are eigenvalues of D(G). In the recent paper, the distance spectrum and distance energy of complement of subgroup graphs of dihedral group are determined.

On the distance spectrum and distance energy of complement of subgroup graphs of dihedral group