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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

H-trees generalizes the existing notions of trees, higher dimensional trees and k-ctrees. The characterizations and properties of both Pk-trees for k at least 4 and Cn-trees for n at least 5 and their hamiltonian property, dominations, planarity, chromatic and b-chromatic numbers are established. The conditions under which Pk-trees for k at least 3 (resp. Cn-trees for n at least 4), are the line graphs are determined. The relationship between path-trees and split graphs are developed.

Path (or cycle)-trees with Graph Equations involving Line and Split Graphs