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...
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 |
Similar Items
-
Generating graceful unicyclic graphs from a given forest
by: G. Sethuraman, et al.
Published: (2020-01-01) -
Alpha graphs with different pendent paths
by: Christian Barrientos
Published: (2020-10-01) -
Graceful labeling on torch graph
by: Jona Martinus Manulang, et al.
Published: (2018-06-01) -
A new class of graceful graphs: k-enriched fan graphs and their characterisations
by: M. Haviar, et al.
Published: (2021-08-01) -
Radio Graceful Hamming Graphs
by: Niedzialomski Amanda
Published: (2016-11-01)