Super total labeling (a,d)-edge antimagic on the firecracker graph

Juhari, Juhari (2020) Super total labeling (a,d)-edge antimagic on the firecracker graph. Cauchy: Jurnal Matematika Murni dan Aplikasi, 6 (3). pp. 133-139. ISSN 2086-0382

[img] Text
7123.pdf - Published Version
Available under License Creative Commons Attribution Share Alike.

Download (627kB)

Abstract

An An (a, d)-edge antimagic total labeling on (p, q)-graph G is a one-to-one map f from V (G) ∪ E(G) onto the i nteger s 1, 2, . . ., p + q with the property that the edge-weights, w(uv) = f (u) + f(v) + f(uv) where uv ∈ E(G), form an arithmetic progression starting from a and having common
difference d. Such labeling is cal led super if the smal lest possible labels appear on the vertices. In this paper, we investigate the existence of super (a, d)-edge antimagic total labeling of Firecracker Graph.

Item Type: Journal Article
Keywords: super (a, d)-edge-antimagic total labeling; firecracker graph (Fn, k)
Subjects: 01 MATHEMATICAL SCIENCES > 0101 Pure Mathematics > 010101 Algebra and Number Theory
Divisions: Faculty of Mathematics and Sciences > Department of Mathematics
Depositing User: Juhari Juhari
Date Deposited: 19 Nov 2020 15:37

Downloads

Downloads per month over past year

Origin of downloads

Actions (login required)

View Item View Item