Abstract
An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to the set of integers { 1, 2, ..., q } such that all vertex weights are pairwise distinct, where a vertex weight is the sum of labels of all edges incident with the vertex. A graph is antimagic if it has an antimagic labeling.
Completely separating systems arose from certain problems in information theory and coding theory. Recently these systems have been shown to be useful in constructing antimagic labelings of particular graphs.
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
Bača, M., Miller, M.: Super Edge-Antimagic Graphs: a Wealth of Problems and Some Solutions. BrownWalker Press, Boca Raton (2008)
Cheng, Y.: A new class of antimagic Cartesian product graphs. Discrete Math. 308(24), 6441–6448 (2008), http://dx.doi.org/10.1016/j.disc.2007.12.032
Cranston, D.W.: Regular bipartite graphs are antimagic. J. Graph Theory 60(3), 173–182 (2009), http://dx.doi.org/10.1002/jgt.20347
Dickson, T.J.: On a problem concerning separating systems of a finite set. J. Combinatorial Theory 7, 191–196 (1969)
Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Combin. 16(\(\sharp\)DS6) (2009)
Hartsfield, N., Ringel, G.: Pearls in graph theory: a comprehensive introduction. Academic Press Inc., Boston (1990)
Phanalasy, O., Miller, M., Iliopoulos, C.S., Pissis, S.P., Vaezpour, E.: Construction of antimagic labeling for the Cartesian product of regular graphs (preprint)
Phanalasy, O., Miller, M., Rylands, L., Lieby, P.: On a relationship between completely separating systems and antimagic labeling of regular graphs (submitted)
Rényi, A.: On random generating elements of a finite Boolean algebra. Acta Sci. Math. Szeged 22, 75–81 (1961)
Roberts, I.T.: Extremal Problems and Designs on Finite Sets. Ph.D. thesis, Curtin University of Technology (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ryan, J., Phanalasy, O., Miller, M., Rylands, L. (2011). On Antimagic Labeling for Generalized Web and Flower Graphs. In: Iliopoulos, C.S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2010. Lecture Notes in Computer Science, vol 6460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19222-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-19222-7_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19221-0
Online ISBN: 978-3-642-19222-7
eBook Packages: Computer ScienceComputer Science (R0)