BibTex Citation Data :
@article{JM3879, author = {Novi Irawati and Robertus Soelistyo}, title = {PELABELAN TOTAL TITIK AJAIB PADA COMPLETE GRAPH DENGAN n GANJIL}, journal = {MATEMATIKA}, volume = {13}, number = {3}, year = {2012}, keywords = {}, abstract = {Let G be a graph consists of edges and vertex. A vertex-magic total labeling of a graph is a bijection map of union edges and vertex to the integers such that there exists a positive integer satisfying , for every elements of vertex . Then k is called a magic constant and G is called vertex-magic total graph. In this article, we consider a vertex-magic labeling of complete graph for odd with use an algorithm which is composed of a modified construction magic square algorithm.}, url = {https://ejournal.undip.ac.id/index.php/matematika/article/view/3879} }
Refworks Citation Data :
Last update:
Last update: 2024-11-05 23:24:50