اخبار و اعلانات

 آمار

تعداد نشریات48
تعداد شماره‌ها1,235
تعداد مقالات10,615
تعداد مشاهده مقاله21,415,827
تعداد دریافت فایل اصل مقاله14,410,625
Shahabi, Maedeh, Rahbarnia, Freydoon. (1404). A Metaheuristic and LP-Based Approach to Irregular Face Coloring in Planar Graphs. فصلنامه علمی زیست فناوری گیاهان زراعی, (), -. doi: 10.30473/coam.2025.75246.1325
Maedeh Shahabi; Freydoon Rahbarnia. "A Metaheuristic and LP-Based Approach to Irregular Face Coloring in Planar Graphs". فصلنامه علمی زیست فناوری گیاهان زراعی, , , 1404, -. doi: 10.30473/coam.2025.75246.1325
Shahabi, Maedeh, Rahbarnia, Freydoon. (1404). 'A Metaheuristic and LP-Based Approach to Irregular Face Coloring in Planar Graphs', فصلنامه علمی زیست فناوری گیاهان زراعی, (), pp. -. doi: 10.30473/coam.2025.75246.1325
Shahabi, Maedeh, Rahbarnia, Freydoon. A Metaheuristic and LP-Based Approach to Irregular Face Coloring in Planar Graphs. فصلنامه علمی زیست فناوری گیاهان زراعی, 1404; (): -. doi: 10.30473/coam.2025.75246.1325

A Metaheuristic and LP-Based Approach to Irregular Face Coloring in Planar Graphs

Control and Optimization in Applied Mathematics
مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 14 آذر 1404    اصل مقاله (1.32 M)
نوع مقاله: Research Article
شناسه دیجیتال (DOI): 10.30473/coam.2025.75246.1325
نویسندگان
Maedeh Shahabi؛ Freydoon Rahbarnia*
Department of Applied Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad, P.O. Box 1159-91775, Mashhad, Iran.
چکیده
In irregular coloring, each vertex is labeled with a unique color code, a tuple consisting of its assigned color and the number of neighbors in each color class‎. ‎This work proposes a local search algorithm as a metaheuristic approach to the irregular face coloring problem in planar graphs‎, ‎with a particular focus on fullerene molecular structures‎. ‎Additionally‎, ‎a linear programming model is utilized to validate the performance of the proposed algorithm‎. ‎The methodology demonstrates efficient solutions for irregular coloring in fullerene graphs‎, bridging combinatorial optimization with practical applications in chemistry and materials science‎.‎

تازه های تحقیق
  • A local search metaheuristic is developed to compute irregular face colorings by assigning distinct color codes to all vertices.
  • An integer linear programming (ILP) formulation is employed to validate the accuracy and efficiency of the proposed heuristic, particularly for large and regular graph instances.
  • The method provides effective irregular face coloring for fullerene graphs, demonstrating the applicability of combinatorial optimization techniques to molecular structures in chemistry and materials science.
کلیدواژه‌ها
Irregular coloring‎؛ ‎Face coloring‎؛ Linear programming‎؛ ‎Metaheuristic algorithm‎؛ ‎Fullerene graphs‎؛ ‎Planar graphs
مراجع

[1] Anderson, M., Vitray, R., Yellen, J. (2012). “Irregular colorings of regular graphs”. Discrete Mathematics, 15, 2329-2336, https://doi.org/10.1016/j.disc.2012.03.039.

[2] Bakaein, S., Tavakoli, M., Ashrafi, A.R., Ori, O. (2018). “Coloring of fullerenes”. Fullerenes, Nanotubes and Carbon Nanostructures, 26(11), 705-708, https://doi.org/10.1080/1536383X.2018.1481049.

[3] Chartrand, G., Zhang, P. (2008). “Chromatic graph theory”. Chapman & Hall/CRC, New York, https://doi.org/10.1201/9781584888017.

[4] Fowler, P.W., Manolopoulos, D.E. (1995). “An Atlas of Fullerenes”. Clarendon Press, Oxford 1995 ISBN 0 19 855787 6, Fullerene Science and Technology, 4(3), 623–624, https://doi.org/10.1080/10641229608001575.

[5] Hamed-Labbafian, Z., Sabeghi, N., Tavakoli, M., Klavzar, S. (2025). “Three algorithmic approaches to the general position problem”. Bulletin of the Australian Mathematical Society, 1-9, https://doi.org/10.1017/S0004972725100178.

[6] Myrant, C. (2014). “Face-wise chromatic number”. Ursidae: The Undergraduate Research Journal at the University of Northern Colorado, 4(2), Available at: https://digscholarship.unco.edu/urj/vol4/iss2/10.

[7] Mosavi, H., Tavakoli, M. (2024). “Using the graph p-distance coloring algorithm for partitioning atoms of some fullerenes”. Fullerenes, Nanotubes and Carbon Nanostructures, 32, 908-915, https://doi.org/10.1080/1536383X.2024. 2342684.

[8] Mosawi, H., Tavakolli, M., Ghorbani-Moghadam, K. (2024). “A hybrid Floyd-Warshall and graph coloring algorithm for finding the smallest number of colors needed for a distance coloring of graphs”. Control and Optimization in Applied Mathematics, 9(1), 185-194, https://doi.org/10.30473/coam.2023.68880.1244.

[9] Noori, N.S., Tawfiq, I.M. (2023). “Coloring graph and four-color theorem”. Journal for Research in Applied Sciences and Biotechnology, 2(5), https://doi.org/10.55544/jrasb.2.5.16.

[10] Radcliffe, M., Zhang, P., Haynes, T.W. (2006). “On irregular colorings of graphs”. AKCE International Journal of Graphs and Combinatorics, 3(2), 175-191, https://doi.org/10.1080/09728600.2006.12088815.

[11] Rohini, A., Venkatachalam, M., Sangamithra, R. (2020). “Irregular colorings of derived graphs of flower graph”. SeMA Journal, 77, 47-57, https://doi.org/10.1007/s40324-019-00201-1.

[12] Slanina, Z., Zhao, X., Lee, S.L., Ōsawa, E. (1997). “C90 temperature effects on relative stabilities of the IPR isomers”. Chemical Physics, 219(2-3), 193-200, https://doi.org/10.1016/S0301-0104(97)00097-9.

آمار
تعداد مشاهده مقاله: 6
تعداد دریافت فایل اصل مقاله: 1


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب