Let G be a finite simple graph with v vertices and e edges. A super vertex-magic total labeling of G is a bijection λ from V(G) ∪ E(G) to { 1, 2, ... , v + e} with the property that for every vertex x in G, the sum λ(x)± Σ λ(xy) is a constant and λ(V(G)) = {1, 2, ... , v}. We present YEN(x) certain families of circulant graphs that admit super vertex-magic total labelings and also some graphs that do not admit any super vertex-magic total labeling.
展开▼