Title
Graceful Graphs With Pendant Edges
Abstract
A graceful labeling of a graph G of size n is an injective assignment of labels from {0,1,... n} to the vertices of G such that when each edge of G has assigned a weight defined by the absolute difference of its end-vertices, the resulting weights are distinct. In this paper, we study graceful labelings of graphs with pendant edges attached; in particular, we provide graceful labelings for graphs of the form Ġ nK1and G + nK1 when G is a graceful graph with order greater than its size. We also show a graceful labeling of the unicyclic graph formed by a cycle with any number of pendant edges attached.
Publication Date
12-1-2005
Publication Title
Australasian Journal of Combinatorics
Volume
33
Number of Pages
99-107
Document Type
Article
Personal Identifier
scopus
Copyright Status
Unknown
Socpus ID
77957668215 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/77957668215
STARS Citation
Barrientos, Christian, "Graceful Graphs With Pendant Edges" (2005). Scopus Export 2000s. 3151.
https://stars.library.ucf.edu/scopus2000/3151