IDEAS home Printed from https://ideas.repec.org/a/hin/jijmms/8290780.html

Resolving Edge Colorings: Exact Results and a Tabu Search Heuristic

Author

Listed:
  • Narjes Sabeghi
  • Zohre Shoja
  • Ahmad Erfanian
  • Mostafa Tavakoli

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.

Suggested Citation

  • Narjes Sabeghi & Zohre Shoja & Ahmad Erfanian & Mostafa Tavakoli, 2026. "Resolving Edge Colorings: Exact Results and a Tabu Search Heuristic," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2026, pages 1-14, August.
    • Handle: RePEc:hin:jijmms:8290780
    DOI: 10.1155/ijmm/8290780
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/ijmms/2026/8290780.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/ijmms/2026/8290780.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/ijmm/8290780?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jijmms:8290780. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.