Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4650445 | Discrete Mathematics | 2008 | 6 Pages |
Abstract
A graph G of order p and size q is called (a,d)(a,d)-edge-antimagic total if there exists a bijective function f:V(G)∪E(G)→{1,2,…,p+q}f:V(G)∪E(G)→{1,2,…,p+q} such that the edge-weights w(uv)=f(u)+f(v)+f(uv)w(uv)=f(u)+f(v)+f(uv), uv∈E(G)uv∈E(G), form an arithmetic sequence with first term a and common difference d. The graph G is said to be super (a,d)(a,d)-edge-antimagic total if the vertex labels are 1,2,…,p1,2,…,p. In this paper we study super (a,d)(a,d)-edge-antimagic properties of mKnmKn, that is, of the graph formed by the disjoint union of m copies of KnKn.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Martin Bača, Christian Barrientos,