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/876http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/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.
-
Vertex and edge-vertex graceful labeling on neutrosophic graphs
Vetrivel, Govindan; Mullai, Murugappan (Işık University Press, 2025-02-01)A graph G with gracefully numbered labels is known as graceful labeling. An intuitionistic fuzzy graph/ neutrosophic graph, which admits graceful labeling, and if all vertex labels are distinct by each membership, then the ... -
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 ... -
Graceful coloring of ladder graphs
Laavanya, D.; Yamini, S. Devi (Işık University Press, 2024-07)A graceful k-coloring of a non-empty graph G = (V, E) is a proper vertex coloring f : V (G) → {1, 2, ..., k}, k ≥ 2, which induces a proper edge coloring f*: E(G) → {1, 2, ..., k − 1} defined by f*(uv) = |f(u) − f(v)|, ...