On super edge-antimagic total labelings of mK
详细信息 查看全文
- 作者：Martin Bač ; a ; Christian Barrientos
- 关键词：Complete graphs ; ; none ; color ; black"" href=""/science?_ob=MathURL&_method=retrieve&_udi=B6V00-4PVY2XY-4&_mathId=mml11&_user=10&_cdi=5632&_pii=S0012365X07007212&_rdoc=3&_issn=0012365X&_acct=C000050221&_version=1&_
- 刊名：Discrete Mathematics
- 出版年：2008
- 出版时间：28 November 2008
- 年：2008
- 卷：308
- 期：22
- 页码：5032-5037
- 全文大小：144 K
文摘
A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijective function f:V(G)E(G)→{1,2,…,p+q} such that the edge-weights w(uv)=f(u)+f(v)+f(uv), uvE(G), form an arithmetic sequence with first term a and common difference d. The graph G is said to be super (a,d)-edge-antimagic total if the vertex labels are 1,2,…,p. In this paper we study super (a,d)-edge-antimagic properties of mKn, that is, of the graph formed by the disjoint union of m copies of Kn.