z-logo
open-access-imgOpen Access
New Classes of Graceful Trees
Author(s) -
Md. Forhad Hossain,
Md Momin Al Aziz,
M. Kaykobad
Publication year - 2014
Publication title -
journal of discrete mathematics
Language(s) - English
Resource type - Journals
eISSN - 2090-9837
pISSN - 2090-9845
DOI - 10.1155/2014/194759
Subject(s) - vertex (graph theory) , computer science , mathematics , combinatorics , theoretical computer science , graph
Graceful labeling is one of the most researched problems. One of the earliest results is that caterpillars are graceful. We show that caterpillars connected to a vertex recursively satisfying certain conditions are also graceful

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