z-logo
open-access-imgOpen Access
VGTool: Web Tool for Visualizing and Determining the Class of Gracefully Labeled Tree
Author(s) -
Jannatul Maowa,
Sharifa Rania
Publication year - 2018
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/ijca2018917364
Subject(s) - computer science , tree (set theory) , class (philosophy) , world wide web , information retrieval , data science , artificial intelligence , mathematics , combinatorics
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom