PRIME LABELING OF SUBDIVIDED HELM GRAPHS
Advances and Applications in Discrete Mathematics · 22.04.2026 · 43 (4) · 401-418
DOI: 10.17654/0974165826026 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances and Applications in Discrete Mathematics, online erschienen am 22.04.2026. Verfasst von Ramesh R. Kanzariya und 2 weiteren Autor:innen. Die Arbeit nennt 7 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
A prime labeling of a graph $G$ with $p$ vertices is a bijection $f:V(G)\to \{1,2, …, p\}$ such that $\text{gcd}(f(x), f(y))=1$ for every edge $xy \in E(G)$. Prime labeling has been widely studied for several well-known graph families. In this paper, we establish prime labeling for graphs obtained from the disjoint union of two copies of helm graph under various edge subdivision operations. These include subdivisions of edges incident to the apex vertex, edges of the cycle $C_n$, edges joining the cycle to pendant vertices, and the barycentric subdivision of the helm graph.
Zitieren
APA
Kanzariya, R. R., Chaurasia, M. A., & Rupani, M. P. (2026). PRIME LABELING OF SUBDIVIDED HELM GRAPHS. Advances and Applications in Discrete Mathematics, 43(4), 401-418. https://doi.org/10.17654/0974165826026
Vancouver
Kanzariya RR, Chaurasia MA, Rupani MP. PRIME LABELING OF SUBDIVIDED HELM GRAPHS. Advances and Applications in Discrete Mathematics. 2026;43(4):401-418. doi:10.17654/0974165826026
BibTeX
@article{Kanzariya2026,
author = {Kanzariya, Ramesh R. and Chaurasia, Mehul A. and Rupani, Mehul P.},
title = {PRIME LABELING OF SUBDIVIDED HELM GRAPHS},
journal = {Advances and Applications in Discrete Mathematics},
year = {2026},
volume = {43},
number = {4},
pages = {401--418},
doi = {10.17654/0974165826026}
}
EUVIMED