A (p, q)-graph G is (a, d)-edge antimagic total if there exists a bijection f : V (G) [ E(G) → {1, 2, . . . , p + q} such that the edge weights ?(uv) = f(u) + f(uv) + f(v), uv ε E(G) form an arithmetic progression with first term a and common difference d. It is said to be a super (a, d)-edge antimagic total if the vertex labels are {1, 2, . . . , p} and the edge labels are {p + 1, p + 2, . . . , p + q}. In this paper, we study the super (a, d)-edge antimagic total labeling of special classes of graphs derived from copies of generalized ladder, fan, generalized prism and web graph.
CITATION STYLE
Pushpam, P. R. L., & Saibulla, A. (2012). On super (a, d)-edge antimagic total labeling of certain families of graphs. Discussiones Mathematicae - Graph Theory, 32(3), 535–543. https://doi.org/10.7151/dmgt.1623
Mendeley helps you to discover research relevant for your work.