Near-Cordial Labeling of K₂-Corona Graphs

Author(s)	Mr. Kugasiya Viraj Ghansiyambhai
Country	India
Abstract	Let H be a finite simple graph of order n and size q. We study a natural binary-labeling construction on the K₂-corona H ⊙ K₂. Starting from a friendly labeling g of H, each vertex v of H is kept with label g(v), while the two new vertices in the attached copy of K₂ receive the opposite label 1 − g(v). For this canonical opposite-pair extension we derive exact formulas for the vertex and edge discrepancies. These formulas yield sufficient conditions for cordiality and upper bounds for the closeness measure D₂. The results are presented as a framework for studying K₂-corona graphs; they are not claimed here as a complete characterization or as a verified novel theorem against the entire literature.
Keywords	cordial labeling; friendly labeling; K₂-corona; binary labeling; vertex discrepancy; edge discrepancy; graph labeling.
Field	Mathematics
Published In	Volume 8, Issue 5, September-October 2026
Published On	2026-10-15
DOI	https://doi.org/10.36948/ijfmr.2026.v08i05.89767

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9687-828-838	editor@ijfmr.com

International Journal For Multidisciplinary Research