VULNERABILITY IN NETWORKS

Basit Öğe Kaydı
dc.contributor.authorVaytac, V.
dc.date.accessioned2019-10-27T09:48:33Z
dc.date.available2019-10-27T09:48:33Z
dc.date.issued2019
dc.departmentEge Üniversitesien_US
dc.description.abstractRecently defined exponential domination number is reported as a new measure to graph vulnerability. It is a methodology, emerged in graph theory, for vulnerability analysis of networks. Also, it gives more sensitive results than other available measures. Exponential domination number has great significance both theoretically and practically for designing and optimizing networks. In this paper, it is studied how some of the graph types perform when they suffer a vertex failure. When its vertices are corrupted, the vulnerability of a graph can be calculated by the exponential domination number which gives more information about the characterization of the network.en_US
dc.identifier.endpage373en_US
dc.identifier.issn2146-1147
dc.identifier.issn2146-1147en_US
dc.identifier.issue2en_US
dc.identifier.startpage366en_US
dc.identifier.urihttps://hdl.handle.net/11454/29541
dc.identifier.volume9en_US
dc.identifier.wosWOS:000462906300020en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherTurkic World Mathematical Socen_US
dc.relation.ispartofTwms Journal of Applied and Engineering Mathematicsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectGraph vulnerabilityen_US
dc.subjectnetwork design and communicationen_US
dc.subjectdominationen_US
dc.subjectexponential domination numberen_US
dc.subjectrobustnessen_US
dc.subjectthorn graphsen_US
dc.titleVULNERABILITY IN NETWORKSen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu