Super Vertex-magic Total Labelings of Graphs
نویسندگان
چکیده
Let G be a finite simple graph with v vertices and e edges. A vertex-magic total labeling is a bijection λ from V (G)∪E(G) to the consecutive integers 1, 2, · · · , v+e with the property that for every x ∈ V (G), λ(x) + Σy∈N(x)λ(xy) = k for some constant k. Such a labeling is super if λ(V (G)) = {1, · · · , v}. We study some of the basic properties of such labelings, find some families of graphs that admit super vertex-magic labelings and show that some other families of graphs do not.
منابع مشابه
Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملVertex magic total labelings of 2-regular graphs
A vertex magic total (VMT) labeling of a graph G = (V,E) is a bijection from the set of vertices and edges to the set of integers defined by λ : V ∪E → {1, 2, . . . , |V | + |E|} so that for every x ∈ V , w(x) = λ(x)+ ∑ xy∈E λ(xy) = k, for some integer k. A VMT labeling is said to be a super VMT labeling if the vertices are labeled with the smallest possible integers, 1, 2, . . . , |V |. In thi...
متن کاملMagic Labelings on Cycles and Wheels
We present efficient algorithms to generate all edge-magic and vertex-magic total labelings on cycles, and all vertex-magic total labelings on wheels. Using these algorithms, we extend the enumeration of the total labelings on these classes of graphs.
متن کاملOn vertex antimagicness of disjoint union of graphs
Let G = (V,E) be a graph of order n and size e. An (a, d)-vertexantimagic total labeling is a bijection α from V (G) ∪ E(G) onto the set of consecutive integers {1, 2, . . . , n + e}, such that the vertex-weights form an arithmetic progression with the initial term a and the common difference d. The vertex-weight of a vertex x is the sum of values α(xy) assigned to all edges xy incident to the ...
متن کاملVertex-Magic Total Labelings of Complete Bipartite Graphs
A vertex-magic total labeling on a graph G is a one-to-one map λ from V (G) ∪E(G) onto the integers 1, 2, · · · , |V (G) ∪E(G)| with the property that, given any vertex x, λ(x) + ∑ y∼x λ(y) = k for some constant k. In this paper we completely determine which complete bipartite graphs have vertex-magic total labelings.
متن کامل