본문 바로가기
KERD
논문KCI 등재

On super edge-magic labeling of some graphs

1

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

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

Abstract

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

참고문헌 (6)

  1. H. Enomoto, "Super edge-magic graphs", SUT Journal of Mathematics, 34(2), pp.105~109 (1998)
  2. A. Kotzig, "Magic valuations of finite graphs", Canadian Mathematical Bulletin, 13, pp.451~461 (1970)
  3. G. Ringel, "Another tree conjecture", Bulletin of the Institute of Combinatorics and its Applications, 18, pp.83~85 (1996)
  4. W. D. Wallis, "Magic Graphs" (2001), Birkh¨auser Boston, Inc.
  5. W. D. Wallis, "Edge-magic total labelings", The Australasian Journal of Combinatorics, 22, pp.177~190 (2000)
  6. D. B. West, "Introduction to Graph Theory" (1996), Prentice Hall, Inc.

관련 논문AI추천

이 간행물의 다른 논문 (19건)