Cordial Labeling of Mycielskian Graphs
Symmetry · 07.11.2026 · 18 (11) · 1865
DOI: 10.3390/sym18111865 ↗Kurz gefasst
Fachartikel in der Zeitschrift Symmetry, online erschienen am 07.11.2026. Verfasst von Soundar Rajan Somasundaram und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Cordial labeling is a well-established graph labeling scheme with rich combinatorial properties and significant applications in graph theory. In this paper, we investigate the existence of cordial labelings for the mycielskian of trees, cycles, complete bipartite graphs Km,n, and bull graph. We present explicit vertex labelings that satisfy the cordiality conditions and show how the mycielskian transformation affects the labeling behavior of the underlying graph. These results extend the current understanding of cordial labeling under graph transformations and yield new classes of mycielskian graph that admit cordial labeling.
Zitieren
APA
Somasundaram, S. R., & Jayapal, B. B. (2026). Cordial Labeling of Mycielskian Graphs. Symmetry, 18(11), 1865. https://doi.org/10.3390/sym18111865
Vancouver
Somasundaram SR, Jayapal BB. Cordial Labeling of Mycielskian Graphs. Symmetry. 2026;18(11):1865. doi:10.3390/sym18111865
BibTeX
@article{Somasundaram2026,
author = {Somasundaram, Soundar Rajan and Jayapal, Baskar Babujee},
title = {Cordial Labeling of Mycielskian Graphs},
journal = {Symmetry},
year = {2026},
volume = {18},
number = {11},
pages = {1865},
doi = {10.3390/sym18111865}
}
EUVIMED