An edge-magic total labeling of a graph G is a one-toone map λ from V (G) ∪ E(G) onto the integers {1, 2, · · · , |V (G) ∪ E(G)|} with the property that, there is an integer constant c such that λ(x) + λ(x, y) + λ(y) = c for any (x, y) ∈ E(G). If λ(V (G)) = {1, 2, · · · , |V (G|} then edge-magic total labeling is called super edgemagic total labeling. In this paper we formulate super edge-magic...

24 A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection 25 l : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum 26 of the labels on the vertices in the open neighborhood of v, is a constant. 27 In this paper, we show that hypercubes with dimension divisible by four 28 are not distance magic. We also provide some positive results by providing ...

An edge-magic total labeling of a graph G is a one-toone map λ from V (G) ∪ E(G) onto the integers {1, 2, · · · , |V (G) ∪ E(G)|} with the property that, there is an integer constant c such that λ(x) + λ(x, y) + λ(y) = c for any (x, y) ∈ E(G). If λ(V (G)) = {1, 2, · · · , |V (G|} then edge-magic total labeling is called super edgemagic total labeling. In this paper, we formulate super edge-magi...

We thank Shuky Sagiv and H akan Jakobsson for many insightful discussions on cost analysis. Raghu Ramakr-ishnan and Jee Ullman provided valuable comments. The Starburst project at IBM Almaden Research Center and the NAIL! project at Stanford University provided a stimulating environment for this work. References AU79] Alfred Aho and Jeerey D. Ullman. Universal-ity of data retrieval languages. l...

A graph G admits an H-covering if every edge of belongs to a subgraph isomorphic given H. is said be H-magic there exists bijection f:V(G)∪E(G)→{1,2,…,|V(G)|+|E(G)|} such that wf(H′)=∑v∈V(H′)f(v)+∑e∈E(H′)f(e) constant, for H′ In particular, H-supermagic f(V(G))={1,2,…,|V(G)|}. When H complete K2, H-(super)magic labeling edge-(super)magic labeling. Suppose F-covering and two graphs F We define (...

The integration of EMST into the complete query-rewrite rule system enables us to eliminate the unnecessary complexity introduced by EMST in the query graph. EMST uses bcf adornments, can push equality and condition predicates, can push local and join predicates , adorns and transforms queries in one phase, can handle correlations, and is extensible. We have developed a cost-based heuristic to ...

For any abelian group A, a graph G = (V, E) is said to be A-magic if there exists a labeling l : E(G) −→ A − {0} such that the induced vertex set labeling l : V (G) −→ A defined by l(v) = ∑ { l(uv) | uv ∈ E(G) } is a constant map. In this paper we will consider the Klein-four group V4 = ZZ 2 ⊕ ZZ 2 and investigate graphs that are V4-magic.

A vertex-magic group edge labeling of a graph G(V,E) with |E| = n is an injection from E to an abelian group Γ of order n such that the sum of labels of all incident edges of every vertex x ∈ V is equal to the same element μ ∈ Γ. We completely characterize all Cartesian products Cn Cm that admit a vertex-magic group edge labeling by Z2nm, as well as provide labelings by a few other finite abeli...

Let G = (V,E) be a graph of order n. Let f : V → {1, 2, . . . , n} be a bijection. For any vertex v ∈ V , the neighbor sum ∑u∈N(v) f(u) is called the weight of the vertex v and is denoted by w(v). If w(v) = k, (a constant) for all v ∈ V , then f is called a distance magic labeling with magic constant k. If the set of vertex weights forms an arithmetic progression {a, a+ d, a+2d, . . . , a+ (n− ...

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.