Supermagic Graphs with Many Different Degrees

Abstract

Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f from the set of edges E to a set of consecutive integers {a, a + 1, . . . , a + e − 1} such that for every vertex v ∈ V the sum of labels of all adjacent edges equals the same constant k. This k is called a magic constant of f, and G is a supermagic graph.

Keywords

• graph labeling
• supermagic labeling
• non-regular graphs
• 05c70
• 05c78