Some results on graceful centers of Pn and related α-graceful graphs
Citation
Hardik, M., Kaneria, V., Andharia, P. & Jadeja, D. (2022). Some results on graceful centers of Pn and related α-graceful graphs. TWMS Journal Of Applied And Engineering Mathematics, 12(3), 908-918.Abstract
In this paper, we have proved that the graph obtained by joining two copies of a bipartite graceful graph by an edge with any two corresponding vertices of both the copies of graphs is α-graceful. We also proved path step tree and path double step tree are α-graceful and the graph Pm × Pn × P2 is α-graceful. Graceful center of graceful graph defined. We also found some some graceful centers of path Pn. Acharya and Gill [1] proved Pn × Pm is α-graceful. In this paper we proved its generalized result.
Source
TWMS Journal Of Applied And Engineering MathematicsVolume
12Issue
3URI
http://jaem.isikun.edu.tr/web/index.php/archive/116-vol12no3/876http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/4686
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.
-
M Modulo N graceful labeling of path union and join sum of complete bipartite graphs with its algorithms
Velmurugan, C.; Ramachandran, Varatharaja (Işık University Press, 2022)A graceful labeling of a graph G(p, q) is an injective assignment of labels from the set {0, 1, ..., q} to the vertices of G such that when each edge of G has been assigned a label defined by the absolute difference of its ... -
Some new classes of graceful diameter six trees
Panda, Amaresh Chandra; Mishra, Debdas (Işık University Press, 2015)Here we denote a diameter six tree by (a0; a1, a2, . . . , am; b1, b2, . . . , bn; c1, c2, . . . , cr), where a0 is the center of the tree; ai, i = 1, 2, . . . , m, bj , j = 1, 2, . . . , n, and ck, k = 1, 2, . . . , r are ... -
Key distribution using graphs for secret sharing
Malhotra, Rishabh; Chandramowliswaran, Narayanaswamy (Işık University Press, 2021)Key distribution for secret sharing is the core important aspect of any secure cryptosystem, the threshold scheme enables a secret key to be shared among p members in which each member holds a part of the secret key. In ...