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/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

An ordered partition Π of the vertex-set resolves a (not necessarily connected) graph G if the representations of all vertices are distinct. The minimum k such that there is a resolving k-partition Π of G is called the partition dimension of G, and denoted by pd(G) or pdd(G) for a connected or a disconnected G, respectively. In this paper, we determine the partition dimension of some homogenous disconnected graphs, namely a disjoint union of stars, double stars and some cycles

Partition Dimension of Some Classes of Homogenous Disconnected Graphs