Edge Antimagic Total Labeling on Two Copies of Path

被引：0

作者：

Nurdin ^{[1
]}

Abrar, A. M. ^{[1
]}

Bhayangkara, A. R. M. ^{[1
]}

Muliani ^{[1
]}

Samsir, A. U. ^{[1
]}

Nahdi, M. R. An ^{[1
]}

机构：

[1] Hasanuddin Univ, Fac Math & Nat Sci, Dept Math, Makassar, Indonesia

来源：

2ND INTERNATIONAL CONFERENCE ON SCIENCE (ICOS) | 2018年 / 979卷

关键词：

D O I：

10.1088/1742-6596/979/1/012065

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

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 vertical bar V(G) vertical bar = p and vertical bar E(G) vertical bar = q. Graph of orderp 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) =integral(u) + integral(v) + Av) form an arithmetic sequence {a, a + d, a + 2d,...,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 boolean OR P-n) denoted by 2P(n). In this paper we construct the (a,d)-edge-anti magic total labeling in two copies of path for some differences d.

引用

页数：6