Resolving Edge Colorings: Exact Results and a Tabu Search Heuristic

Narjes Sabeghi, Zohre Shoja, Ahmad Erfanian and Mostafa Tavakoli

International Journal of Mathematics and Mathematical Sciences, 2026, vol. 2026, 1-14

Abstract: This study presents new results on resolving edge colorings in graphs, a concept introduced by V. Saenpholphat and P. Zhang in 2003. We determine the resolving edge chromatic number for several well-known families of graphs, including complete graphs, complete bipartite graphs, wheel graphs, sun graphs, and friendship graphs. Additionally, we investigate how this invariant behaves under graph operations such as the corona product, join, and Cartesian product. In this study, we establish several formal results, presented as theorems, by employing the Tabu Search metaheuristic algorithm on certain types of graphs.

Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/ijmms/2026/8290780.pdf (application/pdf)
http://downloads.hindawi.com/journals/ijmms/2026/8290780.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:8290780

DOI: 10.1155/ijmm/8290780

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().