AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of G, respectively, and |V|=n and |E|=e. A vertex magic total labeling is a bijection λ from V∪E to the consecutive integers 1,2,…,n+e with the property that for every v∈V, λ(v)+∑w∈N(v)λ(v,w)=h, for some constant h. Such a labeling is super if λ(V(G))={1,2,…,n}. MacDougall, Miller and Sugeng proposed the conjecture: If n≡0(mod4), n>4, then Kn has a super vertex-magic total labeling (VMTL). We prove that this conjecture holds true by means of giving a family of super VMTLs of K4l, l>1
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (an...
For a graph G, with the vertex set V(G) and the edge set E(G) an edge-magic total labeling is a bije...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
Let G = (V, E) be a finite non-empty graph. A vertex-magic total labeling (VMTL) is a bijection lamb...
AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of...
AbstractIt is shown that if p≥6 is any even integer such that p≡2mod(4) then the complete graph Kp h...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f ...
AbstractLet n be an odd positive integer. It is shown that the complete graph Kn has a vertex magic ...
AbstractLet G be a finite simple graph with p vertices and q edges. A vertex magic total labeling is...
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 :...
Let G = (V,E) be a graph of order n and let D ⊆ {0, 1, 2, 3, . . .}. For v ∈ V, let N<sub>D</sub>(v)...
Let G=(V,E) be a finite graph, where |V|=n≥2 and |E|=e≥1. A vertex-magic total labeling is a bijecti...
A graph $G=(V,E)$ is said to be $\textit{magic}$ if there exists an integer labeling $f: V \cup E \t...
AbstractLet sC3 denote the disjoint union of s copies of C3. For each integer t≥2 it is shown that t...
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (an...
For a graph G, with the vertex set V(G) and the edge set E(G) an edge-magic total labeling is a bije...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...
Let G = (V, E) be a finite non-empty graph. A vertex-magic total labeling (VMTL) is a bijection lamb...
AbstractLet G=(V,E) be a finite non-empty graph, where V and E are the sets of vertices and edges of...
AbstractIt is shown that if p≥6 is any even integer such that p≡2mod(4) then the complete graph Kp h...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f ...
AbstractLet n be an odd positive integer. It is shown that the complete graph Kn has a vertex magic ...
AbstractLet G be a finite simple graph with p vertices and q edges. A vertex magic total labeling is...
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 :...
Let G = (V,E) be a graph of order n and let D ⊆ {0, 1, 2, 3, . . .}. For v ∈ V, let N<sub>D</sub>(v)...
Let G=(V,E) be a finite graph, where |V|=n≥2 and |E|=e≥1. A vertex-magic total labeling is a bijecti...
A graph $G=(V,E)$ is said to be $\textit{magic}$ if there exists an integer labeling $f: V \cup E \t...
AbstractLet sC3 denote the disjoint union of s copies of C3. For each integer t≥2 it is shown that t...
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (an...
For a graph G, with the vertex set V(G) and the edge set E(G) an edge-magic total labeling is a bije...
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the ve...