## Abstract

Let G = (V, E) be a finite, simple and undirected graph with p vertices and q edges. An edge-magic total labeling of a graph G is a bijection f: V(G) ∪ E(G) → {1, 2,...,p + q}, where there exists a constant k such that f(u)+f(uυ)+f(υ) = k, for every edge uυ ∈ E(G). Moreover, if the vertices are labeled with the numbers 1, 2,..., p such a labeling is called a super edge-magic total labeling. The super edge-magic deficiency of a graph G, denoted by μ _{s},(G), is the minimum nonnegative integer n such that G∪nK _{1} has a super edge-magic total labeling or ∞ if there exists no such n. In this paper we study the super edge-magic deficiencies of web graph Wb _{n,m}, Jahangir graph J _{2,n}, crown products L _{n}⊙K _{1}, K _{4}⊙ nK _{1} and we give an exact value of super edge-magic deficiency for one class of lobster tree.

Original language | English |
---|---|

Pages (from-to) | 355-364 |

Number of pages | 10 |

Journal | Utilitas Mathematica |

Volume | 87 |

Publication status | Published - Mar 2012 |

Externally published | Yes |

## Keywords

- Crown product
- Jahangir graph
- Lobster tree
- Super edge-magic total deficiency
- Web graph

## ASJC Scopus subject areas

- Statistics and Probability
- Statistics, Probability and Uncertainty
- Applied Mathematics