Super Edge-Magic Labelings of Book Graphs B-n

作者：Yang Yuansheng^*; Xi Yue; Xu Xirong; Meng Xinhong; Haque Khandoker Mohammed Mominul

来源：Ars Combinatoria, 2009, 93: 431-438.

• book graph
• super edge-magic labeling
• vertex labeling
• edge labeling

A graph G is called super edge-magic if there exists a bijection f from V(G) boolean OR E(G) to {1, 2,..., vertical bar V(G)vertical bar + vertical bar E(G)vertical bar} such that f(u) + f(nu) + f(u nu) = C is a constant for any u nu is an element of E(G) and f(V(G)) = {1, 2,..., vertical bar V(G)vertical bar}, f(E(G)) = {vertical bar V(G)vertical bar + 1, vertical bar V(G)vertical bar + 2,..., vertical bar V(G)vertical bar + vertical bar E(G)vertical bar}. R. M Figueroa-Centeno et al. provided the following conjecture: For every integer n >= 5, the book B-n is super edge-magic if and only if n is even or n equivalent to 5(mod 8). In this paper, we show that B-n is super edge-magic for even n >= 6.

• 出版日期2009-10
• 单位大连理工大学