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

A k-regular graph (k ≥ 1) with n vertices is called a quasi-strongly regular graph with parameter λ (λ ∈ N) if any two adjacent vertices have exactly λ neighbors in common. A graph product is a binary operation on graphs. It is useful to describe graph as product of other primitive graphs. In this paper we present some necessary and sufficient conditions for Decartes product, Tensor product, Lexicographical product and Strong product to be quasi-strongly regular.

Necessary and sufficient conditions for quasi-strongly regularity of Graph Product