EUVIMEDEUVIMED entdecken
Crossref

Invalid proofs in “edge k-product cordial labeling of graphs” and their revision

Wai Chee Shiu, Gee-Choon Lau

Journal of Combinatorial Mathematics and Combinatorial Computing · 22.07.2026 · 131 · 237-251

DOI: 10.61091/jcmcc131-12 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 22.07.2026. Verfasst von Wai Chee Shiu und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper identifies and corrects invalid arguments in [Edge k-Product Cordial Labeling of Graphs, Eur. J. Pure Appl. Math., 18(2), Article No. 5887 (2025)]. In particular, several published statements are shown to be false through explicit counterexamples. Revised versions of these results are established under appropriate conditions, often involving structural properties such as girth. Correct bounds or conditions are obtained for specific graph classes, including shadow graphs, splitting graphs of stars, and path unions of cycles. These corrections clarify the limitations of the earlier claims and provide a more accurate foundation for further study of edge k-product cordial labeling.

Zitieren

APA

Shiu, W. C., & Lau, G. (2026). Invalid proofs in “edge k-product cordial labeling of graphs” and their revision. Journal of Combinatorial Mathematics and Combinatorial Computing, 131, 237-251. https://doi.org/10.61091/jcmcc131-12

Vancouver

Shiu WC, Lau G. Invalid proofs in “edge k-product cordial labeling of graphs” and their revision. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;131:237-251. doi:10.61091/jcmcc131-12

BibTeX
@article{Shiu2026,
  author = {Shiu, Wai Chee and Lau, Gee-Choon},
  title = {Invalid proofs in “edge k-product cordial labeling of graphs” and their revision},
  journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
  year = {2026},
  volume = {131},
  pages = {237--251},
  doi = {10.61091/jcmcc131-12}
}
Kostenlos starten →