Open AccessPrime Graceful Labeling
Author(s) -
T. Hameed Hassan,
R. Mohammad Abbas
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i4.36.24234
Subject(s) - combinatorics , injective function , graph , mathematics , vertex (graph theory) , prime (order theory) , path (computing) , edge graceful labeling , graph labeling , discrete mathematics , computer science , graph power , line graph , programming language
A graph G with m vertices and n edges, is said to be prime graceful labeling, if there is an injection from the vertices of G to {1, 2, ..., k} where k = min {2m, 2n} such that gcd ( ( ), ( )=1 and the induced injective function from the edges of G to {1, 2, ..., k − 1} defined by ( ) = | ( ) − ( ) | , the resulting edge labels are distinct. In this paper path , cycle Cn , star K1,n , friendship graph Fn , bistar Bn,n, C4 ∪ Pn , Km,2 and Km,2 ∪ Pn are shown to be Prime Graceful Labeling .