Volume 11, Issue 3 (12-2025)
mmr 2025, 11(3): 31-41 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Rahbarnia F, Hamedlabbafian Z. Approximating the edge general position number of graphs using meta-heuristic algorithms. mmr 2025; 11 (3) :31-41
URL: http://mmr.khu.ac.ir/article-1-3449-en.html
URL: http://mmr.khu.ac.ir/article-1-3449-en.html
1- Ferdowsi uniwersity of mashhad , rahbarnia@ferdowsi.um.ac.ir
2- Ferdowsi uniwersity of mashhad
2- Ferdowsi uniwersity of mashhad
Abstract: (13 Views)
A subset of a graph’s edges is called an edge general position set if, for every pair of edges in the subset, none of the shortest paths between them contain any edge from the subset.
The main objective of this study is to approximate the edge general position number of graphs using metaheuristic algorithms, including the Genetic Algorithm and Simulated Annealing.
The main objective of this study is to approximate the edge general position number of graphs using metaheuristic algorithms, including the Genetic Algorithm and Simulated Annealing.
Type of Study: Original Manuscript |
Subject:
Mat
Received: 2025/06/1 | Revised: 2025/12/17 | Accepted: 2025/10/15 | Published: 2025/12/17 | ePublished: 2025/12/17
Received: 2025/06/1 | Revised: 2025/12/17 | Accepted: 2025/10/15 | Published: 2025/12/17 | ePublished: 2025/12/17
Send email to the article author
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
