Title : ( Optimized determination of saturation numbers in fullerene graphs using tabu search )
Authors: sara oskoueian , Mostafa Tavakoli , Narjes Sabeghi ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
The saturation number is a structural invariant related to matchings. Let G be a graph with edge set EðGÞ: M � EðGÞ is a maximal matching if it is not a subset of some other matching in graph G: The smallest possible number of edges in a maximal matching of G is called the saturation number. Determining the saturation number of a graph is an NP-hard problem. The aim of this paper is to study the Tabu Search (TS) algorithm for solving this problem. The proposed algorithm can be implemented on general graphs. However, in our computational tests, TS found a saturation number for fullerene graphs, and we compared the obtained results with the methods presented in other studies.
Keywords
Saturation number; maximal matching; tabu search
@article{paperid:1100850,
author = {Oskoueian, Sara and Tavakoli, Mostafa and نرجس سابقی},
title = {Optimized determination of saturation numbers in fullerene graphs using tabu search},
journal = {Fullerenes Nanotubes and Carbon Nanostructures},
year = {2024},
month = {November},
issn = {1536-383X},
keywords = {Saturation number; maximal
matching; tabu search},
}
%0 Journal Article
%T Optimized determination of saturation numbers in fullerene graphs using tabu search
%A Oskoueian, Sara
%A Tavakoli, Mostafa
%A نرجس سابقی
%J Fullerenes Nanotubes and Carbon Nanostructures
%@ 1536-383X
%D 2024
