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

In graph theory, a connected component of an undirected graph is a sub graph in which any two vertices are connected to each other by paths. For a graph G, if the subgraph of G itself is a connected component then the graph is called connected, else the graph G is called disconnected and each connected component sub graph is called it's components. A dominating set Dst of graph G=(V,E) is a non-split strong dominating set if the induced sub graph is connected. The non-split strong domination number of G is the minimum cardinality of a non-split strong dominating set . In this paper constructed a verification method algorithm for finding a non-split strong dominating set of an interval graph.

To find a non-split strong dominating set of an interval graph using an algorithm