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

A set  W  of vertices of a connected graph  G  strongly resolves two different vertices  x ,  y  ∉  W  if either  dG( x ,  W ) =  dG( x ,  y ) +  dG( y ,  W ) or  dG( y ,  W ) =  dG( y ,  x ) +  dG( x ,  W ), where  dG( x ,  W ) = min{ d ( x , w ):  w  ∈  W } and  d ( x , w ) represents the length of a shortest  x  −  w  path. An ordered vertex partition  Π  = { U1 ,  U2 ,…, Uk} of a graph  G  is a strong resolving partition for  G , if every two different vertices of  G  belonging to the same set of the partition are strongly resolved by some other set of  Π . The minimum cardinality of any strong resolving partition for  G  is the strong partition dimension of  G . In this article, we obtain several bounds and closed formulae for the strong partition dimension of some families of graphs and give some realization results relating the strong partition dimension, the strong metric dimension and the order of graphs.

Further new results on strong resolving partitions for graphs