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

Finding Minimum Connected Dominating Set in a graph is one of the important problems in graph theory. It is largely applied in Wireless Sensor Networks (WSN). It acts as a virtual backbone in WSNs. algorithms of finding such minimum connected dominating set was studied. A new algorithm for constructing a routing in WSN using one of the algorithms is proposed and implemented using java language. The sample outputs are also included.

CONSTRUCTION OF MINIMUM CONNECTED DOMINATING SET IN A GRAPH AND ITS APPLICATION IN WIRELESS SENSOR NETWORKS