Duplication operations on some families of odd prime graphs
Journal of Combinatorial Mathematics and Combinatorial Computing · 09.05.2026 · 130 · 255-277
DOI: 10.61091/jcmcc130-17 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 09.05.2026. Verfasst von Mohamed Abdelazim Seoud und 3 weiteren Autor:innen.
Abstract (Originalsprache)
A graph G with vertex set V(G) and edge set E(G) is said to have an odd prime labeling if there exists a bijection f : V(G) → {1, 3, 5, …, 2n − 1}, where n = |V(G)|, such that gcd (f(x), f(y)) = 1 for every edge xy ∈ E(G). In this paper, we study odd prime labelings of graphs arising from duplication operations on graph elements. We obtain several results for graphs derived from the path graph Pn, the cycle graph Cn, and the star graph K1, n under various vertex- and edge-duplication constructions.
Zitieren
APA
Seoud, M. A., Elsonbaty, A. A., Anwar, M., & Elkady, H. (2026). Duplication operations on some families of odd prime graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 130, 255-277. https://doi.org/10.61091/jcmcc130-17
Vancouver
Seoud MA, Elsonbaty AA, Anwar M, Elkady H. Duplication operations on some families of odd prime graphs. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;130:255-277. doi:10.61091/jcmcc130-17
BibTeX
@article{Seoud2026,
author = {Seoud, Mohamed Abdelazim and Elsonbaty, Ahmed Abdelgawad and Anwar, Mohamed and Elkady, Hassan},
title = {Duplication operations on some families of odd prime graphs},
journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
year = {2026},
volume = {130},
pages = {255--277},
doi = {10.61091/jcmcc130-17}
}
EUVIMED