Odd Graceful Labeling of Acyclic Graphs.

dc.contributor.authorRiasat, Ayesha
dc.date.accessioned2018-10-23T05:37:46Z
dc.date.available2018-10-23T05:37:46Z
dc.date.issued2015-06-09
dc.description.abstractLet 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.en_US
dc.identifier.citationRiasat, A.,& Javed, S. (2015). Odd Graceful Labeling of Acyclic Graphs. American Journal of Applied Mathematics, 3(3-1), 14-18. (Ayesha Riasat)en_US
dc.identifier.issn2330-006X
dc.identifier.urihttps://escholar.umt.edu.pk/handle/123456789/3382
dc.language.isoenen_US
dc.publisherAmerican Journal of Applied Mathematicsen_US
dc.subjectMathematicsen_US
dc.subjectOdd-Graceful Labeling, Comb, Star, Path, Bistaren_US
dc.titleOdd Graceful Labeling of Acyclic Graphs.en_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Odd Graceful Labeling of Acyclic Graphs. .pdf
Size:
190 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: