Abstract
In this paper a known algorithm used for the construction of completely separating systems (CSSs), Roberts’ Construction, is modified and used in a variety of ways to build CSSs. The main interest is in CSSs with different block sizes. A connection between CSSs and vertex antimagic edge labeled graphs is then exploited to prove that various non-regular graphs are antimagic. An outline for an algorithm which produces some of these non-regular graphs together with a vertex antimagic edge labeling is presented.
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, A., Kaplan, G., Lev, A., Rodity, Y., Yuster, R.: Dense graphs are antimagic. J. Graph Theory 47(4), 297–309 (2004)
Bodendiek, R., Walther, G.: On number theoretical methods in graph labelings. Res. Exp. Math. 21, 3–25 (1995)
Chawathe, P.D., Krishna, V.: Antimagic labelings of complete m-ary trees. In: Number Theory and Discrete Mathematics. Trends Math., pp. 77–80. Birkhäuser, Basel (2002)
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. 19(\(\sharp\)DS6) (2012)
Hartsfield, N., Ringel, G.: Pearls in Graph Theory: A Comprehensive Introduction. Academic Press Inc., Boston (1990)
Hefetz, D.: Anti-magic graphs via the combinatorial nullstellensatz. J. Graph Theory 50(4), 263–272 (2005)
Kotzig, A., Rosa, A.: Magic valuations of complete graphs. Publ. Centre de Recherches Mathématiques, Université de Montréal 175, CRM–175 (1972)
Kotzig, A.: On certain vertex-valuations of finite graphs. Utilitas Math. 4, 261–290 (1973)
Kotzig, A., Rosa, A.: Magic valuations of finite graphs. Canad. Math. Bull. 13, 451–461 (1970)
MacDougall, J.A., Miller, M., Slamin, Wallis, W.D.: Vertex magic total labelings of graphs. Utilitas Math. 61, 3–21 (2002)
MacDougall, J.A., Miller, M., Wallis, W.D.: Vertex magic total labelings of wheels and related graphs. Utilitas Math. 62, 175–183 (2002)
Phanalasy, O.: Covering Separating Sytems. Master’s thesis, Northern Territory University, Australia (1999)
Phanalasy, O., Miller, M., Rylands, L., Lieby, P.: On a relationship between completely separating systems and antimagic labeling of regular graphs. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol. 6460, pp. 238–241. Springer, Heidelberg (2011)
Ramsay, C., Roberts, I.T., Ruskey, F.: Completely separating systems of k-sets. Discrete Math. 183(1–3), 265–275 (1998)
Roberts, I.T.: Extremal Problems and Designs on Finite Sets. Ph.D. thesis, Curtin University of Technology, Australia (1999)
Sedláček, J.: Problem 27. In: Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), pp. 163–164. Publ. House Czechoslovak Acad. Sci, Prague (1964)
Stewart, B.M.: Magic graphs. Canad. J. Math. 18, 1031–1056 (1966)
Wallis, W.D.: Magic graphs. Birkhäuser Boston Inc., Boston (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rylands, L., Phanalasy, O., Ryan, J., Miller, M. (2013). An Application of Completely Separating Systems to Graph Labeling. In: Lecroq, T., Mouchard, L. (eds) Combinatorial Algorithms. IWOCA 2013. Lecture Notes in Computer Science, vol 8288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45278-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-45278-9_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45277-2
Online ISBN: 978-3-642-45278-9
eBook Packages: Computer ScienceComputer Science (R0)