A survey and a new class of graceful unicylic graphs

A graph G admits a graceful labeling if there is a one-to-one map f from the set of vertices of G to such that when an edge xy is assigned the label the resulting set of edge labels is When such a labeling exists, G is called graceful. Rosa showed that a cycle Cn () is graceful if and only if n is c...

Full description

Bibliographic Details
Main Authors: Max Pambe Biatch’, Jay S. Bagga, S. Arumugam
Format: Article
Language:English
Published: Taylor & Francis Group 2020-10-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Online Access:http://dx.doi.org/10.1080/09728600.2020.1832853