On Complementary Edge Magic Labeling ofCertain Graphs
نویسندگان
چکیده
منابع مشابه
Further Results on Complementary Super Edge Magic Graph Labeling
Abstract : In this paper we introduced the concept of complementary super edge magic labeling and Complementary Super Edge Magic strength of a graph G.A graph G (V, E ) is said to be complementary super edge magic if there exist a bijection f:V U E → { 1, 2, ............p+q } such that p+q+1 f(x) is constant. Such a labeling is called complementary super edge magic labeling with complementary s...
متن کاملEdge-Magic Labeling of some Graphs
An edge magic labeling f of a graph with p vertices and q edges is a bijection f: V ∪ E → {1, 2, ..., p + q } such that there exists a constant s for any (x, y) in E satisfying f(x) + f(x, v) + f(y)= s. In this paper, the edge-magic labelings of ncm and some other graphs are discussed.
متن کاملOn consecutive edge magic total labeling of graphs
Let G = (V,E) be a finite (non-empty) graph, where V and E are the sets of vertices and edges of G. An edge magic total labeling is a bijection α from V ∪E to the integers 1,2, . . . , n+e, with the property that for every xy ∈E, α(x)+α(y)+α(xy)= k, for some constant k. Such a labeling is called an a-vertex consecutive edge magic total labeling if α(V )= {a + 1, . . . , a + n} and a b-edge cons...
متن کاملTotally magic cordial labeling of some graphs
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملtotally magic cordial labeling of some graphs
a graph g is said to have a totally magic cordial labeling with constant c if there exists a mapping f : v (g) ∪ e(g) → {0, 1} such that f(a) + f(b) + f(ab) ≡ c (mod 2) for all ab ∈ e(g) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. in this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Mathematics and Statistics
سال: 2012
ISSN: 2162-948X
DOI: 10.5923/j.ajms.20120203.02