Abstract
An antimagic labeling of a finite simple undirected graph with q edges is a bijection from the set of edges to the set of integers {1, 2, ⋯ , q} such that the vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of labels of all edges incident to such vertex. A graph is called antimagic if it admits an antimagic labeling. It was conjectured by N. Hartsfield and G. Ringel in 1990 that all connected graphs besides K 2 are antimagic. Another weaker version of the conjecture is every regular graph is antimagic except K 2. Both conjectures remain unsettled so far. In this article, certain classes of regular graphs of odd degree with particular type of perfect matchings are shown to be antimagic. As a byproduct, all generalized Petersen graphs and some subclass of Cayley graphs of ℤ n are antimagic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Kaplan, G., Lev, A., Roditty, Y., Yuster, R.: Dense graphs are antimagic. Journal of Graph Theory 47(4), 297–309 (2004)
Miller, M., Bača, M.: Antimagic valuations of generalized Petersen graphs. Australasian Journal of Combinatorics 22, 135–139 (2000)
Bača, M., Jendrol, S., Miller, M., Ryan, J.: Antimagic Labelings of Generalized Petersen Graphs That Are Plane. Ars Combinatoria (2004)
Barrus, M.D.: Antimagic labeling and canonical decomposition of graphs. Information Processing Letters 110(7), 261–263 (2010)
Cheng, Y.: A new class of antimagic Cartesian product graphs. Discrete Mathematics 308(24), 6441–6448 (2008)
Cheng, Y.: Lattice grids and prisms are antimagic. Theoretical Computer Science 374(1V3), 66–73 (2007)
Cranston, D.: Regular bipartite graphs are antimagic. Journal of Graph Theory 60(3), 173–182 (2009)
Gallian, J.A.: A dynamic survey of graph labeling. The Electronic Journal of Combinatorics DS6, 1–79 (2001)
Hartsfield, N., Ringel, G.: Pearls in Graph Theory, pp. 108–109. Academic Press, Inc., Boston (1990) (Revised version 1994)
Hefetz, D.: Anti-magic graphs via the combinatorial nullstellensatz. Journal of Graph Theory 50(4), 263–272 (2005)
Huang, P.Y., Wong, T.L., Zhu, X.: Weighted-1-antimagic graphs of prime power order. To appear in Discrete Mathematics (2011)
Lee, M., Lin, C., Tsai, W.: On Antimagic Labeling For Power of Cycles. Ars Combinatoria 98, 161–165 (2011)
Petersen, J.: Die Theorie der regularen graphs. Acta Mathematica (15), 193–220 (1891)
Stewart, B.M.: Magic graphs. Canadian Journal of Mathematics 18, 1031–1059 (1966)
Wang, T.-M.: Toroidal Grids Are Anti-magic. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 671–679. Springer, Heidelberg (2005)
Wang, T.M., Hsiao, C.C.: On Antimagic Labeling for Graph Products. Discrete Mathematics 308, 3624–3633 (2008)
Wong, T.L., Zhu, X.: Antimagic labelling of vertex weighted graphs. To appear in Journal of Graph Theory (2011)
Zhang, Y., Sun, X.: The antimagicness of the Cartesian product of graphs. Theoretical Computer Science 410, 727–735 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, TM., Zhang, GH. (2012). On Antimagic Labeling of Odd Regular Graphs. In: Arumugam, S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2012. Lecture Notes in Computer Science, vol 7643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35926-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-35926-2_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35925-5
Online ISBN: 978-3-642-35926-2
eBook Packages: Computer ScienceComputer Science (R0)