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

48Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Sugeng, K. A., Miller, M., Slamin, & Bača, M. (2005). (a, d)-Edge-antimagic total labelings of caterpillars. In Lecture Notes in Computer Science (Vol. 3330, pp. 169–180). Springer Verlag. https://doi.org/10.1007/978-3-540-30540-8_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free