EVEN AND ODD ANTIMAGIC TOTAL LABELING ON TOTAL GRAPH OF PATHS AND CYCLES
Keywords:
VATL, EATL, Odd vertex(edge) antimagic total labeling, Even vertex(edge) antimagic total labeling, Totally Antimagic Total Labeling
Abstract
Consider a graph G = (V,E) with s nodes and t links. In this paper, we introduce two types of labeling, namely odd-vertex(edge) antimagic total labeling and even-vertex(edge) antimagic total labeling. A vertex(edge) antimagic total labeling is called odd vertex(edge) antimagic total labeling if φ(V (G)) = {1, 3, ..., 2s − 1} and it is even vertex(edge) antimagic total labeling if φ(V (G)) = {2, 4, · · · , 2s}. Here we discuss even and odd vertex antimagic total labeling and edge antimagic total labeling on total graph of paths and cycles.
Published
2025-11-02
How to Cite
N. Nagaparvatham, T. Kannan, & CT. Nagaraj. (2025). EVEN AND ODD ANTIMAGIC TOTAL LABELING ON TOTAL GRAPH OF PATHS AND CYCLES. Statistics, Optimization & Information Computing, 15(3), 1976-1985. https://doi.org/10.19139/soic-2310-5070-2946
Issue
Section
Research Articles
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
