# Edge Antimagic Total Labeling on Two Copies of Path
> Nurdin

URL kanonis: https://discover.unhas.ac.id/publications/pub_scopus_85044418923
Jurnal / Konferensi: Journal of Physics Conference Series
Tahun terbit: 2018
DOI: https://doi.org/10.1088/1742-6596/979/1/012065
ISSN: 17426588
Citations: 0

## Authors
- Nurdin

## Abstract
A graph G = (V(G), E(G)) denotes the vertex set and the edge set, respectively. A ( p , q )-graph G is a graph such that | V(G) | = p and | E(G) | = q . Graph of order p and size q is called ( a , d )-edge-anti magic total if there exists a bijection f : V(G) U E(G)→ {1,2,..., p + q } such that the edge weights w ( u , v ) = f ( u ) + f ( uv ) + f ( v ) form an arithmetic sequence { a , a + d , a + 2 d ,..., a + ( q – 1) d } with the first term a and common difference d . Two copies of path is disjoint union of two path graph with same order ( P n ∪ P n ) denoted by 2 P n . In this paper we construct the ( a , d )-edge-anti magic total labeling in two copies of path for some differences d.

## Keywords
- Combinatorics
- Mathematics
- Bijection
- Graph
- Vertex (graph theory)
- Discrete mathematics

---
Sumber: Discover Unhas — RIMS Universitas Hasanuddin.
Saat mengutip, gunakan DOI bila tersedia atau URL kanonis di atas.