• 대한수학회보
• /
• 제45권1호
• /
• pp.11-21
• /
• 2008

A graph G = (V, E) is called super edge-magic if there exists a one-to-one map $\lambda$ from V $\cup$ E onto {1,2,3,...,|V|+|E|} such that $\lambda$(V)={1,2,...,|V|} and $\lambda(x)+\lambda(xy)+\lambda(y)$ is constant for every edge xy. In this paper, we investigate whether some families of graphs are super edge-magic or not.

• 대한수학회논문집
• /
• 제32권1호
• /
• pp.225-231
• /
• 2017

Baskoro et al. [1] provided some constructions of new super edge-magic graphs from some old ones by attaching 1, 2, or 3 pendant vertices and edges. In this paper, we introduce (q, m)-super edge-magic total labeling and we give a construction of new super edge-magic graphs by attaching n pendant vertices and edges under some conditions, for any positive integer n. Also, we give a constraint on our construction.

• Journal of applied mathematics & informatics
• /
• 제40권1_2호
• /
• pp.117-132
• /
• 2022

Reverse edge magic(REM) labeling of the graph G = (V, E) is a bijection of vertices and edges to a set of numbers from the set, defined by λ : V ∪ E → {1, 2, 3, …, |V| + |E|} with the property that for every xy ∈ E, constant k is the weight of equals to a xy, that is λ(xy) - [λ(x) + λ(x)] = k for some integer k. We given the construction of REM labeling for the Cartesian Product, Unions of Braids and Unions of Triangular Belts. The Kotzig array used in this paper is the 3 × (2r + 1) kotzig array. we test the konow results about REM labelling that are related to the new results we found.