PELABELAN TOTAL TITIK AJAIB PADA COMPLETE GRAPH n K DENGAN N GENAP
Abstract
Let G be a graph with vertex set and edge set and let and .
A vertex-magic total labeling of a graph is a bijection map from to the integers
such that there exists a positive integer satisfying , for every
. Then k is called a magic constant and G is called vertex-magic total graph. In [5] have discussed
vertex-magic labeling of complete graph for odd, now in this article, we consider a vertex-magic
labeling of complete graph for even with use an algorithm which is composed of a modified
construction magic square algorithm.
Keywords : vertex-magic total labeling, Complete graph , magic square
A vertex-magic total labeling of a graph is a bijection map from to the integers
such that there exists a positive integer satisfying , for every
. Then k is called a magic constant and G is called vertex-magic total graph. In [5] have discussed
vertex-magic labeling of complete graph for odd, now in this article, we consider a vertex-magic
labeling of complete graph for even with use an algorithm which is composed of a modified
construction magic square algorithm.
Keywords : vertex-magic total labeling, Complete graph , magic square
Full Text:
PDFArticle Metrics
Abstract view : 312 timesPDF - 919 times
Refbacks
- There are currently no refbacks.