Distance Antimagic Labeling for Copies of Graph
DOI:
https://doi.org/10.25077/jmua.15.3.319-324.2026Keywords:
distance antimagic labeling, distance antimagic graph, copies of graphAbstract
Let G be a graph with vertex set V(G) and edge set E(G). Let f be a bijective function from the vertex set V(G) to the set {1,2,3,... ,|V(G)|} and weight of vertex v in V(G) is the sum of labels of all neighbors of vertex v. If there is no pair of vertices of V(G) have equal weight, then f is called a distance antimagic labeling and G is called a distance antimagic graph. Copies of graph G, denoted as nG is disjoint union of n graphs which each is isomorphic to G. In this paper, we present several results on distance antimagic labeling of copies of graph.
Downloads
References
[1] Kamachi, N., Arumugam, S., 2013, Distance Antimagic Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 84: 61–67
[2] Handa, A.K., Godinho, A., Singh, T., 2016, Some Distance Antimagic Labeled Graphs, Algorithms and Discrete Applied Mathematics, Vol. 9602: 190–200
[3] Handa, A.K., Godinho, A., Singh, T., Arumugam, S., 2017, Distance antimagic labeling of join and corona of two graphs, AKCE International Journal of Graphs and Combinatorics, Vol. 14(2): 172–177
[4] Simanjuntak, R., Nadeak, T., Yasin, F., Wijaya, K., Hinding, M., Sugeng, K.A., 2021, Another Antimagic Conjecture, Symmetry, Vol. 13: 2071
[5] Simanjuntak, R., Tritama, A., 2022, Distance Antimagic Product Graphs, Symmetry, Vol. 14: 1411
[6] Burr, A., Erdos, P., Spencer, J.H., 1975, Ramsey theorems for multiple copies of graphs, Transactions Of The American Mathematical Society, Vol. 209: 87–99
[7] Gallian, J.A., 2024, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, Vol. 17
[8] West, D.B., 2001, Introduction to Graph Theory, 2nd, Prentice Hall
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Departemen Matematika dan Sains Data FMIPA UNAND

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA 4.0). This license allows published content to be freely accessed, shared, redistributed, and adapted for any purpose, including commercial use, provided that the applicable license conditions are followed.
Copyright Holder
The copyright of articles published in Jurnal Matematika UNAND is held by the Departemen Matematika dan Sains Data, Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA), Universitas Andalas (UNAND), in accordance with the journal's stated copyright policy.
Author Rights
Under the CC BY-SA 4.0 license, authors may share, distribute, and reuse their published articles, subject to the applicable license conditions. These rights include:
-
Self-Archiving: Authors may deposit their published articles in institutional repositories, personal websites, or academic platforms.
-
Reuse: Authors may reuse their published work in subsequent publications, research, teaching materials, or other lawful purposes, provided that appropriate attribution is maintained.
-
Distribution: Authors may share and distribute their published articles without requiring additional permission under the terms of the license.
Creative Commons License (CC BY-SA 4.0)
Under the CC BY-SA 4.0 license, users are free to:
-
Share: Copy and redistribute the material in any medium or format.
-
Adapt: Remix, transform, and build upon the material for any purpose, including commercial purposes.
These permissions are subject to the following conditions:
-
Attribution: Users must give appropriate credit to the original author(s), retain relevant copyright notices, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author(s), copyright holder, or journal.
-
ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same CC BY-SA 4.0 license or a compatible license.
-
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from exercising the rights granted by the license.
For more information about the CC BY-SA 4.0 license, please visit:
https://creativecommons.org/licenses/by-sa/4.0/
Third-Party Content
Third-party materials, including figures, tables, photographs, and illustrations, are covered by the article's CC BY-SA 4.0 license only when their inclusion under that license is authorized.
Materials excluded from the license must be clearly identified with appropriate copyright notices and attribution. Authors are responsible for obtaining any necessary permissions, while users must comply with the applicable licensing terms or permissions when reusing excluded materials.
Copyright and Licensing Information
Copyright and licensing information should be clearly displayed on each published article's landing page and included in the full-text versions (HTML and PDF), where applicable, to ensure transparency regarding copyright ownership and permitted reuse.



