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

Jha, Pradhan, and Banerjee devised a linear algorithm to compute the securedomination number of a cograph. Here it is shown that their Lemma~2, which iscrucial for the computational complexity of the algorithm, is incomplete. Anaccordingly modified lemma is proved and it is demonstrated that the complexityof the modified algorithm remains linear.

Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee