SD-prime cordial labeling of subdivision K₄−snake and related graphs
Citation
Prajapati, U. M. & Vasantlal, V. A. (2023). SD-prime cordial labeling of subdivision K₄−snake and related graphs. TWMS Journal Of Applied And Engineering Mathematics, 13(1), 386-399.Abstract
Let f : V (G) → {1, 2, . . . , |V (G)|} be a bijection, and let us denote S = f(u)+f(v) and D = |f(u)−f(v)| for every edge uv in E(G). Let fʹ be the induced edge labeling, induced by the vertex labeling f, defined as fʹ: E(G) → {0, 1} such that for any edge uv in E(G), fʹ(uv) = 1 if gcd(S, D) = 1, and fʹ(uv) = 0 otherwise. Let e(fʹ) (0) and e(fʹ) (1) be the number of edges labeled with 0 and 1 respectively. f is SD-prime cordial labeling if |e(fʹ) (0) − e(fʹ) (1)| ≤ 1 and G is SD-prime cordial graph if it admits SD-prime cordial labeling. In this paper, we have discussed the SD-prime cordial labeling of subdivision of K4−snake S(K₄Sn), subdivision of double K₄−snake S(D(K₄Sn)), subdivision of alternate K₄−snake S(A(K₄Sn)) of type 1, 2 and 3, and subdivision of double alternate K₄− snake S(DA(K₄Sn)) of type 1, 2 and 3.
Source
TWMS Journal Of Applied And Engineering MathematicsVolume
13Issue
1URI
https://hdl.handle.net/11729/5230http://jaem.isikun.edu.tr/web/index.php/current/118-vol13no1/972
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.
-
Prime labeling in the context of subdivision of some cycle related graphs
Kansagara, Ankur; Patel, Sanjaykumar; Vasava, Jayeshbhai (Işık University Press, 2021)A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set of first n positive integers such that any two adjacent vertices in G have relatively prime labels. The results about prime ... -
Antimagic labeling of the union of subdivided stars
Raheem, Abdul; Baig, Abdul Qudair (Işık University Press, 2016-02-22)Enomoto et al. (1998) defined the concept of a super (a, 0)-edge-antimagic total labeling and proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total labeling. In support of this conjecture, the ... -
On certain topological indices of the derived graphs of subdivision graphs
Hosamani, Sunilkumar M.; Lokesha, Veerebradiah; Cangül, İsmail Naci; Devendraiah, K. M. (Işık University Press, 2016-03-11)The derived graph [G]† of a graph G is the graph having the same vertex set as G, with two vertices of [G]† being adjacent if and only if their distance in G is two. Topological indices are valuable in the study of QSAR/QSPR. ...