Open Access
16 May 2004 Applications of mathematical programming in graceful labeling of graphs
Kourosh Eshghi, Parham Azimi
J. Appl. Math. 2004(1): 1-8 (16 May 2004). DOI: 10.1155/S1110757X04310065


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 label 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.


Download Citation

Kourosh Eshghi. Parham Azimi. "Applications of mathematical programming in graceful labeling of graphs." J. Appl. Math. 2004 (1) 1 - 8, 16 May 2004.


Published: 16 May 2004
First available in Project Euclid: 1 June 2004

zbMATH: 1073.05063
MathSciNet: MR2077876
Digital Object Identifier: 10.1155/S1110757X04310065

Primary: 05C78

Rights: Copyright © 2004 Hindawi

Vol.2004 • No. 1 • 16 May 2004
Back to Top