Independent strong weak domination: A mathematical programming approach

Basit Öğe Kaydı
dc.authoridUgurlu, Onur / 0000-0003-2743-5939
dc.authorscopusid35174269000
dc.authorscopusid55335002500
dc.authorscopusid57193712164
dc.contributor.authorBerberler, Murat Ersen
dc.contributor.authorUğurlu, Onur
dc.contributor.authorBerberler, Zeynep Nihan
dc.date.accessioned2022-02-15T16:57:24Z
dc.date.available2022-02-15T16:57:24Z
dc.date.issued2020
dc.departmentBakırçay Üniversitesien_US
dc.description.abstractLet G = (V, E) be a graph. A subset S subset of V of vertices is a dominating set if every vertex in V - S is adjacent to at least one vertex of S. The domination number is the minimum cardinality of a dominating set. Let u, v is an element of V. Then, u strongly dominates v and v weakly dominates u if (i) uv is an element of E and (ii) deg u >= deg v. A subset D of V is a strong (weak) dominating set of G if every vertex in V - D is strongly (weakly) dominated by at least one vertex in D. The strong (weak) domination number of G is the minimum cardinality of a strong (weak) dominating set. A set D subset of V is an independent (or stable) set if no two vertices of D are adjacent. The independent domination number of C (independent strong domination number, independent weak domination number, respectively) is the minimum size of an independent dominating set (independent strong dominating set, independent weak dominating set, respectively) of G. In this paper, mathematical models are developed for the problems of independent domination and independent strong (weak) domination of a graph. Then test problems are solved by the GAMS software, the optima and execution times are implemented. To the best of our knowledge, this is the first mathematical programming formulations for the problems, and computational results show that the proposed models are capable of finding optimal solutions within a reasonable amount of time.en_US
dc.identifier.doi10.1142/S1793830920500627
dc.identifier.issn1793-8309
dc.identifier.issn1793-8317
dc.identifier.issue5en_US
dc.identifier.scopus2-s2.0-85086221501en_US
dc.identifier.scopusqualityQ3en_US
dc.identifier.urihttps://doi.org/10.1142/S1793830920500627
dc.identifier.urihttps://hdl.handle.net/20.500.14034/145
dc.identifier.volume12en_US
dc.identifier.wosWOS:000577147100006en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherWorld Scientific Publ Co Pte Ltden_US
dc.relation.journalDiscrete Mathematics Algorithms And Applicationsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectDominationen_US
dc.subjectindependent dominationen_US
dc.subjectstrong weak dominationen_US
dc.subjectmathematical programmingen_US
dc.subjectBoundsen_US
dc.titleIndependent strong weak domination: A mathematical programming approachen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
Independent strong weak domination- A mathematical programming approach.pdf
Boyut:
165.75 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu
Temel Bilimler Bölümü Bölümü Koleksiyonu