Skip to main content
SpringerLink
Log in

Constraint programming models and population-based simulated annealing algorithm for finding graceful and \(\alpha \)-labeling of quadratic graphs

  • Original Article
  • Published:
Iran Journal of Computer Science Aims and scope Submit manuscript

Abstract

In this research, a new mathematical integer programming model is presented for the graph labeling problem of quadratic graphs. The advantages of this model are linearity and the existence of an objective function. Furthermore, two constraint programming models and a meta-heuristics algorithm are also developed to generate feasible graceful labeling and \(\alpha \)-labeling for special classes of quadratic graphs. Experimental results on large sizes of graphs from the literature show the efficiency of the proposed model and approach.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Eshghi, K.: Existence and construction of-labeling of 2-regular graphs with three components. PhD diss., Ph. D. thesis, University of Toronto (1997)

  2. Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Comb., 20th edn. 1–415 (2017)

  3. Eshghi, K.: Extension of \(\alpha \)-labelings of quadratic graphs. Int. J. Math. Math. Sci. 2004(11), 571–578 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Eshghi, K., Salarrezaie, M.: An integer programming model and a Tabu search algorithm to generate \(\alpha \)-labeling of special classes of quadratic graph. Iran. J. Oper. Res. (to appear)

  5. Eshghi, K., Salarrezaie, M.: Existence and construction of \(\alpha \)-labeling for quadratic graph \(Q(7,4k)\) and its extensions. Int. J. Graph. Theory Appl. (IJGTA) (to appear)

  6. Rosa, A.: On certain valuations of the vertices of a graph. In: Theory of Graphs, International Symposium, Rome, pp. 349–355 (1966)

  7. Abrham, J., Kotzig, A.: On the missing value in a graceful numbering of a 2-regular graph. Congr. Numer. 65(0988), 261–266 (1988)

    MathSciNet  MATH  Google Scholar 

  8. Kotzig, A.: Decompositions of complete graphs into isomorphic cubes. J. Comb. Theory Ser. B 31(3), 292–296 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lakshmi, D.R., Vangipuram, S.: A note on the graceful numbering of a class of trees. Def. Sci. J. 35, 65–70 (1985)

    Article  Google Scholar 

  10. Salarrezaei, M.: Mathematical programming models for graceful labeling problem of 2-regular graphs. Master of Science thesis, Sharif University of Technology (2012)

  11. Eshghi, K., Azimi, P.: Applications of mathematical programming in graceful labeling of graphs. J. Appl. Math. 1(1), 1–8 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Eshghi, K., Azimi, P.: An algorithm for finding a feasible solution of graph labeling problems. Utilitas Mathematica 72, 163–174 (2007)

    MathSciNet  MATH  Google Scholar 

  13. Redl, T.A.: Graceful graphs and graceful labelings: two mathematical programming formulations and some other new results. Congressus Numerantium 164, 17–32 (2003)

    MathSciNet  MATH  Google Scholar 

  14. Smith, B.M., Puget, J.-F.: Constraint models for graceful graphs. Constraints 15(1), 64–92 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Mahmoudzadeh, H., Eshghi, K.: Metaheuristic approach to the graceful labeling problem. Int. J. Appl. Metaheuristic Comput. IJAMC 1, 42–57 (2010)

    Article  Google Scholar 

  16. Shaabani, H., Kamalabadi, I.N.: An efficient population-based simulated annealing algorithm for the multi-product multi-retailer perishable inventory routing problem. Comput. Ind. Eng. 99, 189–201 (2016)

    Article  Google Scholar 

  17. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  18. Goldberg, D.E., Kalyanmoy, D.: A comparative analysis of selection schemes used in genetic algorithms. Found. Genet. Algorithms 1, 69–93 (1991)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran

    Mohammad Amini & Kourosh Eshghi

Authors
  1. Mohammad Amini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kourosh Eshghi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kourosh Eshghi.

Electronic supplementary material

Below is the link to the electronic supplementary material.

Supplementary material 1 (pdf 429 KB)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Amini, M., Eshghi, K. Constraint programming models and population-based simulated annealing algorithm for finding graceful and \(\alpha \)-labeling of quadratic graphs. Iran J Comput Sci 1, 155–164 (2018). https://doi.org/10.1007/s42044-018-0012-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s42044-018-0012-7

Keywords

Search

Navigation