Odd Graceful Labeling of Acyclic Graphs.
Loading...
Date
2015-06-09
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
American Journal of Applied Mathematics
Abstract
Let G = (V, E) be a finite, simple and undirected graph. A graph G with q edges is said to be odd-graceful if there
is an injection f : V (G) → {0, 1, 2, . . . , 2q− 1} such that, when each edge xy is assigned the label |f (x)− f (y)| , the resulting
edge labels are {1, 3, 5, . . . , 2q− 1} and f is called an odd graceful labeling of G. Motivated by the work of Z. Gao [6] in
which he studied the odd graceful labeling of union of any number of paths and union of any number of stars, we have
determined odd graceful labeling for some other union of graphs. In this paper we formulate odd-graceful labeling for disjoint
unions of graphs consisting of generalized combs, stars, bistars and paths.
Description
Keywords
Mathematics, Odd-Graceful Labeling, Comb, Star, Path, Bistar
Citation
Riasat, A.,& Javed, S. (2015). Odd Graceful Labeling of Acyclic Graphs. American Journal of Applied Mathematics, 3(3-1), 14-18. (Ayesha Riasat)