Some results on graceful centers of Pn and related α-graceful graphs
Künye
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.Özet
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.
Kaynak
TWMS Journal Of Applied And Engineering MathematicsCilt
12Sayı
3Bağlantı
http://jaem.isikun.edu.tr/web/index.php/archive/116-vol12no3/876https://hdl.handle.net/11729/4686
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
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 ... -
Even vertex odd mean labeling of transformed trees
Jeyanthi, Pon; Ramya, D.; Selvi, M. (Işık University Press, 2020)Let G = (V;E) be a graph with p vertices and q edges. A graph G is said have an even vertex odd mean labeling if there exists a function f: V (G) →{0; 2; 4;:::; 2q} satisfying f is 1-1 and the induced map f*: E(G) → {1; ...