科研之友
微信
新浪微博
Facebook
分享链接
摘要
A graph G is called super edge-magic if there exists a bijection f from V(G) U E(G) to {1, 2,..., vertical bar V(G)vertical bar + vertical bar E(G)vertical bar} such that f (u) + f (v) + f (uv) = C is a constant for any uv E E(G) and f (V(G)) = {1, 2,..., vertical bar V(G)vertical bar}. Yasuhiro Fukuchi proved that the generalized Petersen graph P(n, 2) is super edge-magic for odd n >= 3. In this paper, we show that the generalized Petersen graph P(n, 3) is super edge-magic for odd n >= 5.
