Applications of mathematical programming in graceful labeling of graphs
Summary: Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully labeled graphs. In this paper, first a new approach based on the mathematical programming technique is presented to model the graceful labeling problem. Then a branching method is developed to solve the problem for special classes of graphs. Computational results show the efficiency of the proposed algorithm for different classes of graphs. One of the interesting results of our model is in the class of trees. The largest tree known to be graceful has at most 27 vertices but our model can easily solve the graceful labeling for trees with 40 vertices.
- New classes of graceful trees
- Constraint models for graceful graphs
- Constraint Programming Models for Graceful Graphs
- scientific article; zbMATH DE number 2076913 (Why is no real title available?)
- Rapid Mathematical Programming for Cooperative Truck Networks
- Computer search for graceful labeling: a survey
- Novel classes of integers and their applications in graph labeling
- Graceful labelling: state of the art, applications and future directions
This page was built for publication: Applications of mathematical programming in graceful labeling of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2570870)
