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 tree T ( V ,  E ) is graceful if there exists an injective function f from the vertex set V ( T ) into the set {0, 1, 2, ..., ∣ V ∣ − 1} which induces a bijective function f ʹ from the edge set E ( T ) onto the set {1, 2, ..., ∣ E ∣} , with f ʹ( u v ) = ∣ f ( u ) −  f ( v )∣ for every edge { u ,  v } ∈  E . Motivated by the conjecture of Alexander Rosa (see) saying that all trees are graceful, a lot of works have addressed gracefulness of some trees. In this paper we show that some uniform trees are graceful. This results will extend the list of graceful trees.

Some methods for constructing some classes of graceful uniform trees