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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

A tree is a connected acyclic graph on n vertices and n-1 edges. Graceful labeling of a tree is a labeling of its vertices with the numbers from 0 to n-1, so that no two vertices share a label, labels of edges, being absolute difference of the labels of its end points, are also distinct. There is a famous conjecture named Graceful tree conjecture or Ringel-Kotzig Conjecture that says “All trees are graceful”. Almost 50-year old conjecture is yet to be proved. However, researchers have been able to prove that many classes of trees are graceful. In this paper, we have introduced a new web tool named VGTool which help many researcher to know which classes of trees already been proved to be graceful. Moreover, researcher can generate random tree by using this web tool and verify in which class this tree belongs. If it is belongs to some known class then web tool generate graceful labeling of this tree otherwise researcher can try to classify this tree. We hope this web tool will help researcher in a very useful way.

VGTool: Web Tool for Visualizing and Determining the Class of Gracefully Labeled Tree