Super Edge-antimagic Total Labeling of Stair Graph

Aprilia, Ira and D, Dafik and Setiawani, Susi (2011) Super Edge-antimagic Total Labeling of Stair Graph. FKIP Universitas Jember, Universitas Jember. ISBN 978-602-19240-6

Preview

Text atikelseminarunej.pdf Download (1MB) | Preview

Abstract

An (a, d)-edge-antimagic total labeling of G is a one-to-one mapping f taking the vertices and edges onto {1, 2, 3, . . . , p + q} .So that the edge-weights w(uv) = f (u) + f (v) + f (uv), uv ∈ E(G), form an arithmetic progression {a, a + d, a + 2d, . . . , a + (q − 1)d}, where a > 0 and d ≥ 0 are two fixed integers, and form an arithmetic sequence with first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we survey what is known about super edge-antimagic total labelings properties of disconnected Stair graph (St n ).

Actions (login required)

View Item