Get all the updates for this publication
An (a,d)-edge antimagic total labeling of a (p, q)-graph G is bijection f: V ∪ E → {1,2,3,...,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 a, a+d,..., a+(q-1)d, where a >0 and d ≥ 0 are two fixed integers. If such a labeling exists, then G is called an (a,d)-edge antimagic total graph. If further the vertex labels are the integers {1,2,3,...,p}, then f is called a super (a,d)-edge antimagic total labeling of G ((a, d)-SEAMT labeling) and a graph which admits such a labeling is called a super (a,d)-edge antimagic total graph ((a, d)-SEAMT graph). If d=0, then the graph G is called a super edge-magic graph. In this paper we investigate the existence of super (a, 3)-edge antimagic total labelings for union of two stars. © 2017, Springer International Publishing AG.
View more info for "Super (a, 3)-edge Antimagic Total Labeling for Union of Two Stars"
Journal | Data powered by TypesetTheoretical Computer Science and Discrete Mathematics Lecture Notes in Computer Science |
---|---|
Publisher | Data powered by TypesetSpringer International Publishing |
ISSN | 0302-9743 |
Open Access | No |