Skip to main content
Log in

Some results on exclusive sum graphs

  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

Let N(Z) denote the set of all positive integers (integers). The sum graph G +(S) of a finite subset SN(Z) is the graph (S,E) with uvE if and only if u+vS. A graph G is said to be an (integral) sum graph if it is isomorphic to the sum graph of some SN(Z). A sum labelling S is called an exclusive sum labelling if u+vSV(G) for any edge uvE(G). We say that G is labeled exclusively. The least number r of isolated vertices such that GrK 1 is an exclusive sum graph is called the exclusive sum number ε(G) of graph G. In this paper, we discuss the exclusive sum number of disjoint union of two graphs and the exclusive sum number of some graph classes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Harary, F.: Sum graphs and difference graphs. Congr. Numer. 72, 101–108 (1990)

    MathSciNet  Google Scholar 

  2. Harary, F.: Sum graphs over all the integers. Discrete Math. 124, 99–105 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ellingham, M.N.: Sum graphs from trees. Ars Comb. 35, 335–349 (1993)

    MATH  MathSciNet  Google Scholar 

  4. Chen, Z.: Harary’s conjectures on integral sum graphs. Discrete Math. 160, 241–244 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. He, W., Shen, Y., Wang, L., Chang, Y., Kang, Q., Yu, X.: The integral sum number of complete bipartite graphs K r,s. Discrete Math. 239, 137–146 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hartsfield, N., Smyth, W.F.: A family of sparse graphs of large sum number. Discrete Math. 141, 163–171 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  7. He, W., Yu, X., Mi, H., Xu, Y., Sheng, Y., Wang, L.: The (integral) sum number of K n E(K r ). Discrete Math. 243, 241–252 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Liaw, S., Kuo, D., Chang, G.J.: Integral sum numbers of graphs. Ars Comb. 54, 259–268 (2000)

    MATH  MathSciNet  Google Scholar 

  9. Melnikov, L.S., Pyatkin, A.V.: Regular integral sum graphs. Discrete Math. 252, 237–245 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  10. Miller, M., Ryan, J., Slamin: Integral sum numbers of the cocktail party graphs and symmetric complete bipartite graphs. Bull. ICA 25, 23–28 (1999)

    MATH  MathSciNet  Google Scholar 

  11. Pyatkin, A.V.: New formula for the sum number for the complete bipartite graphs. Discrete Math. 239, 155–160 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  12. Miller, M., Ryan, J., Slamin, Sugeng, K., Tuga, M.: Exclusive sum graph labeling. Preprint (2003)

  13. Kratochvil, J., Miller, M., Minh, N.H.: Sum Graph labels—An upper bound and related problems. In: Proceedings of the Twelfth Australasian Workshop on Combinatorial Algorithms, Bandun, Indonesia (2001)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Haitang Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, H., Li, P. Some results on exclusive sum graphs. J. Appl. Math. Comput. 34, 343–351 (2010). https://doi.org/10.1007/s12190-009-0325-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-009-0325-7

Keywords

Mathematics Subject Classification (2000)

Navigation