On Arithmetic Cordial Labeling of Some Graphs
Jason D. Andoyo, Jemina Clarisse C. Prudencio, Ricky F. Rulete

TL;DR
This paper introduces a new type of graph labeling called arithmetic cordial labeling modulo ta, exploring its application to various graph classes under specific conditions on associated functions.
Contribution
It defines and investigates arithmetic cordial labelings for different graphs, extending the concept with conditions on functions ta, ta, and ta.
Findings
Established conditions for arithmetic cordial labeling on star graphs.
Extended the labeling concept to ladder, cycle snake, join, corona, and tensor product graphs.
Provided criteria for the existence of such labelings under various function constraints.
Abstract
Let be a fixed positive integer. Let be a subset of , be a binary function, and be a function. For a simple connected graph of order , a bijective function (where ) is called an arithmetic cordial labeling modulo under if the induced function , defined by whenever or , and whenever , satisfies the condition , where is the number of edges with label (). In this paper, we explore the arithmetic cordial labeling of some graphs under conditions imposed on the function .…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
