antmagic正则二部图.docVIP

Regular Bipartite Graphs Are Antimagic Daniel W. Cranston UNIVERSITY OF ILLINOIS URBANA, ILLINOIS E-mail: cranston@ Received August 21, 2007; Revised June 3, 2008 Published online 19 July 2008 in Wiley InterScience(). DOI 10.1002/jgt.20347 Abstract: A labeling of a graph G is a bijection from E(G) to the set {1, 2, ...,|E (G )|} . A labeling is antimagic if for any distinct vertices u and v, the sum of the labels on edges incident to u is different from the sum of the labels on edges incident tov. We say a graph is antimagic if it has an antimagic labeling. In 1990, Hartsfield and Ringel conjectured that every connected graph other than K 2 is antimagic. In this article, we show that every regular bipartite graph (with degree at least 2) is antimagic. Our technique relies heavily on the Marriage Theorem. ? 2008 Wiley Periodicals Inc. J Graph Theory 60: 173–182, 2009 Keywords: antimagic graph labeling; bipartite graph; regular graph; graph decomposition; Marriage Theorem 1. INTRODUCTION In this article, we study a problem of edge-labeling. We formally define a labeling of a graphG to be a bijection from E (G) to the set {1,...,|E (G)|} .Avertex-sum for a labeling is the sum of the labels on edges incident to a vertex v; we also call this the sum at v. A labeling is antimagic if the vertex-sums are pairwise distinct. A graph isantimagic if it has an antimagic labeling. Hartsfield and Ringel [2] introduced antimagic labelings in 1990 and conjectured that every connected graph other than K2 is antimagic. The most significant progress on this problem is a result of Alon et al. [1], which states the existence of a constant Journal of Graph Theory ? 2008 Wiley Periodicals, Inc. 173 174 JOURNAL OF GRAPH THEORY c such that if G is an n-vertex graph with δ(G) ≥ c log n, then G is antimagic. Large degrees satisfy a natural intuition: the more edges that are present, the more flexibility there is to arrange the labels and possibly obtain an antimagic labeling. For proofs of som