期刊名称：International Journal of Computer and Information Technology
印刷版ISSN：2279-0764
出版年度：2013
卷号：2
期号：3
页码：492
出版社：International Journal of Computer and Information Technology
摘要：The study of graph labeling has focused on finding classes of graphs which admits a particular type of labeling. In this paper we proposed the algorithms to construct antimagic labeling, (a, d)-antimagic labeling, vertex antimagic total labeling and (a, d)-vertex antimagic total labeling of complete graphs, w hich is a generalization of several other types of labelings. A connected graph G(V, E) is said to be antimagic if the edges of the graph are labeled with integers 1 to |E(G)| such that every vertex has a different sum of the labels of the incident edges. A connected graph G(V, E) is said to be (a, d)-vertex antimagic total if there exists a positive i ntegers a, d and a bijection f: V U E . {1,2,…….|V|+|E|} such that the induced mapping g f : V . W is also a bijection, where W={w f (x) | x ε V}={a, a+d, a+2d, ….,a+(|V|-1)d} is the set of weights of vertices in G. Properties of co mplete graphs are studied. How to construct these labelings fo r co mplete graphs are shown. Some new results are proposed from the old one.
关键词：Magic squares; Magic constant; Complete graphs; ; Anti Magic Labeling; (a; 1)-Vertex Anti Magic Total Labeling ; etc
