Abstract
We generalize the concept of exclusive sum labelings of graphs (cf. Miller et al., JCMCC 55:137–148, 2005) and determine the exclusive sum number for several classes of hypergraphs. The results disclose a significant difference between graphs (i.e. 2-uniform hypergraphs) and “genuine” hypergraphs.
Similar content being viewed by others
References
Berge, C.: Hypergraphs. North-Holland, Amsterdam (1989)
Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Comb. 19(DS6), 144–150 (2012)
Harary, F.: Sum graphs and difference graphs. Congr. Numer. 72, 101–108 (1990)
Miller, M., Patel, D., Ryan, J., Sugeng, K.A., Slamin, K.S., Tuga, M.: Exclusive sum labeling of graphs. JCMCC 55, 137–148 (2005)
Ryan, J.: Exclusive sum labeling of graphs: a survey. AKCE J. Graphs Combin. 6(1), 113–126 (2009)
Sonntag, M., Teichert, H.-M.: On the sum number and integral sum number of hypertrees and complete hypergraphs. Discrete Math. 236, 339–349 (2001)
Teichert, H.-M.: The sum number of \(d\)-partite complete hypergraphs. Disc. Math. Graph Theory 19, 79–91 (1999)
Tuga, M., Miller, M., Ryan, J., Ryjáček, Z.: Exclusive sum labelings of trees. JCMCC 55, 109–121 (2005)
Tuga, M., Miller, M.: \(\Delta \)-optimum exclusive sum labeling of certain graphs with radius one. In: Akiyama, J., et al. (eds.) IJCCGGT 2003, LNCS, Vol. 3330, pp. 216–225 (2005)
Wang, H., Li, P.: Some results on exclusive sum graphs. J. Appl. Math. Comput. 34, 343–351 (2010)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sonntag, M., Teichert, HM. Some Results on Exclusive Sum Labelings of Hypergraphs. Graphs and Combinatorics 31, 2401–2412 (2015). https://doi.org/10.1007/s00373-015-1525-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-015-1525-6