Closeness centrality in some splitting networks

Basit Öğe Kaydı
dc.contributor.authorAytac, Vecdi
dc.contributor.authorTuraci, Tufan
dc.date.accessioned2024-09-29T16:11:35Z
dc.date.available2024-09-29T16:11:35Z
dc.date.issued2018
dc.departmentKarabük Üniversitesien_US
dc.description.abstractA central issue in the analysis of complex networks is the assessment of their robustness and vulnerability. A variety of measures have been proposed in the literature to quantify the robustness of networks, and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. Centrality parameters play an important role in the field of network analysis. Numerous studies have proposed and analyzed several centrality measures. We consider closeness centrality which is defined as the total graph-theoretic distance to all other vertices in the graph. In this paper, closeness centrality of some splitting graphs is calculated, and exact values are obtained.en_US
dc.identifier.endpage269en_US
dc.identifier.issn1561-4042
dc.identifier.issue3en_US
dc.identifier.startpage251en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14619/8525
dc.identifier.volume26en_US
dc.identifier.wosWOS:000449530100003en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherInst Mathematics & Computer Science Acaden_US
dc.relation.ispartofComputer Science Journal of Moldovaen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectGraph theoryen_US
dc.subjectnetwork design and communicationen_US
dc.subjectcomplex networksen_US
dc.subjectcloseness centralityen_US
dc.subjectsplitting graphsen_US
dc.titleCloseness centrality in some splitting networksen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu