The Vulnerability of Some Networks including Cycles via Domination Parameters

dc.contributor.authorTuraci, Tufan
dc.contributor.authorAksan, Huseyin
dc.date.accessioned2024-09-29T16:04:52Z
dc.date.available2024-09-29T16:04:52Z
dc.date.issued2016
dc.departmentKarabük Üniversitesien_US
dc.description.abstractLet G = (V(G), E(G)) be an undirected simple connected graph. A network is usually represented by an undirected simple graph where vertices represent processors and edges represent links between processors. Finding the vulnerability values of communication networks modeled by graphs is important for network designers. The vulnerability value of a communication network shows the resistance of the network after the disruption of some centers or connection lines until a communication breakdown. The domination number and its variations are the most important vulnerability parameters for network vulnerability. Some variations of domination numbers are the 2-domination number, the bondage number, the reinforcement number, the average lower domination number, the average lower 2-domination number, and so forth. In this paper, we study the vulnerability of cycles and related graphs, namely, fans, k-pyramids, and n-gon books, via domination parameters. Then, exact solutions of the domination parameters are obtained for the above-mentioned graphs.en_US
dc.identifier.doi10.1155/2016/4705493
dc.identifier.issn2356-752X
dc.identifier.issn2314-6486
dc.identifier.urihttps://doi.org/10.1155/2016/4705493
dc.identifier.urihttps://hdl.handle.net/20.500.14619/6371
dc.identifier.volume2016en_US
dc.identifier.wosWOS:000378749500001en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherHindawi Ltden_US
dc.relation.ispartofJournal of Optimizationen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectBondage Numberen_US
dc.subjectAverageen_US
dc.subjectDesignen_US
dc.titleThe Vulnerability of Some Networks including Cycles via Domination Parametersen_US
dc.typeArticleen_US

Dosyalar