On super edge-magic deficiency of volvox and dumbbell graphs

Let G=(V,E) be a finite, simple and undirected graph of order p and size q. A super edge-magic total labeling of a graph G is a bijection λ:V(G)∪E(G)→{1,2,…,p+q}, where the vertices are labeled with the numbers 1,2,…,p and there exists a constant t such that f(x)+f(xy)+f(y)=t, for every edge xy∈E(G)...

Full description

Bibliographic Details
Main Authors: Muhammad Imran, Hafiz Usman Afzal, A.Q. Baig
Format: Article
Language:English
Published: Taylor & Francis Group 2016-08-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Online Access:http://www.sciencedirect.com/science/article/pii/S0972860016300871