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 Plus

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

Zendy Tools

Zendy Open

In this paper we define cycle-star graph CSk,n-k to be a graph on n verticesconsisting of the cycle of length k and n-k leafs appended to the same vertexof the cycle. Also, we define cycle-path graph CPk,n-k to be a graph on nvertices consisting of the cycle of length k and of path on n-k vertices whoseone end is linked to a vertex on a cycle. We establish that cycle-star graphCS3,n-3 is the only maximal graph with respect to additively weighted Hararyindex among all unicyclic graphs on n vertices, while cycle-path graph CP3,n-3is the only minimal unicyclic graph (here n must be at least 5). The values ofadditively weighted Harary index for extremal unicyclic graphs are established,so these values are the upper and the lower bound for the value of additivelyweighted Harary index on the class of unicyclic graphs on n vertices.

Extremal unicyclic graphs with respect to additively weighted Harary index