(a, d)-Edge-antimagic total labelings of caterpillars

Kiki Ariyanti, M. Miller, Slamin, M. Bača

Research output: Contribution to journalConference articlepeer-review

40 Citations (Scopus)

Abstract

For a graph G = (V, E), a bijection g from V(G) ∪E(G) into {1,2,..., |V(G)| + |E(G)|} is called (a, d)-edge-antimagic total labeling of G if the edge-weights w(xy) = g(x) + g(y) + g(xy), xy ∈ E(G), form an arithmetic progression with initial term a and common difference d. An (a, d)-edge-antimagic total labeling g is called super (a, d)-edge-antimagic total if g(V(G)) = (1,2,. ..,|V(G)|}. We study super (a,d)-6idge-antimagic total properties of stars Sn and caterpillar Sn1, n2,...n 1.

Original languageEnglish
Pages (from-to)169-180
Number of pages12
JournalLecture Notes in Computer Science
Volume3330
Publication statusPublished - 1 Sep 2005
EventIndonesia-Japan Joint Conference on Combinatorial Geometry and Graph Theory, IJCCGGT 2003 - Bandung, Indonesia
Duration: 13 Sep 200316 Sep 2003

Fingerprint Dive into the research topics of '(a, d)-Edge-antimagic total labelings of caterpillars'. Together they form a unique fingerprint.

Cite this