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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

A dominating set or dset of G is called a s-path dset of G (2 ≤ s ≤ diamG ) if any path of length s ∈ G has ⊆ of one vertex in this dset. We indicate a s-path dset by Dps . The s-path dominaton number or s-path dn of G indicated by γps(G ) is the minimal cardinality or MC taken over all s-path dsets of G . In that paper, we determine domination number and s-path domination number for the brick product graph B(2n,P,Q) (P = 2) related with even cycles.

Domination and s-path domination in some brick product graphs