Let A be a non-trivial Abelian group. We call a graph G = (V, E) A-magic if there exists a labeling f : E → A∗ such that the induced vertex set labeling f : V → A, defined by f(v) = ∑ uv∈E f(uv) is a constant map. In this paper, we show that Kk1,k2,...,kn (ki ≥ 2) is A-magic, for all A where |A| ≥ 3.

A graph G = (V, E) is said to be magic if there exists an integer labeling f : V ∪ E −→ [1, |V ∪ E|] such that f(x) + f(y) + f(xy) is constant for all edges xy ∈ E. Enomoto, Masuda and Nakamigawa proved that there are magic graphs of order at most 3n + o(n) which contain a complete graph of order n. Bounds on Sidon sets show that the order of such a graph is at least n + o(n). We close the gap ...

Background & Aims: Today, different imaging techniques have been studied in the reading of radiationsensitive polymer gels dosage. Due to limitations of imaging techniques such as magnetic resonance imaging (MRI) and computed tomography (CT), ultrasound techniques are proposed for dose-dependent parameter extraction. In this study, using MAGIC-f (methacrylic and ascorbic acid in gelatin initiat...

A (p, q)-graph G is called super edge-magic if there exists a bijective function f : V (G) ∪ E(G) → {1, 2, . . . , p + q} such that f(u)+f(v)+f(uv) is a constant for each uv ∈ E(G) and f(V (G)) = {1, 2, . . . , p}. In this paper, we introduce the concept of strong super edgemagic labeling as a particular class of super edge-magic labelings ∗Supported by Slovak VEGA Grant 1/4005/07. †Supported i...

A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. The graph G is H−magic if there exists a bijection f : V (G) [ E(G) ! {1, 2, 3, · · · , |V (G) [ E(G)|} such that for every subgraph H0 P of G isomorphic to H. G is said to be H − supermagic if f(V (G)) = {1, 2, 3, · · · , |V (G)|}. In thi...

Let G = (V,E) be a graph of order n and let D ⊆ {0, 1, 2, 3, . . .}. For v ∈ V, let ND(v) = {u ∈ V : d(u, v) ∈ D}. The graph G is said to be D-vertex magic if there exists a bijection f : V (G) → {1, 2, . . . , n} such that for all v ∈ V, ∑ u∈ND(v) f(u) is a constant, called D-vertex magic constant. O’Neal and Slater have proved the uniqueness of the D-vertex magic constant by showing that it c...

A graph G is said to have totally magic cordial(TMC) 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 investigate some new families of graphs that admit totally magic cordial labeli...

The MAGIC (MAnagement of Galileo Interference and Counter measures) proposal has been realized in order to answer to the call for tender "GJU call 2416". This European project proposed with the participation of Space Engineering (I), Thales Communications (F), Joanneum Research (A), Teletel (Gr), University of Bologna (I) and France Developpement Conseil (F) was selected in August 2005. MAGIC s...

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...