Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorAytaç, Aysunen_US
dc.contributor.authorOdabaş Berberler, Zeynep Nihanen_US
dc.date.accessioned2020-10-12T11:12:51Z
dc.date.available2020-10-12T11:12:51Z
dc.date.issued2017-06-06
dc.identifier.citationAytaç, A. & Odabaş Berberler, Z. N. (2017). Residual closeness for helm and sunflower graphs. TWMS Journal Of Applied And Engineering Mathematics, 7(2), 209-220.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2625
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/96-vol7no2/298
dc.description.abstractVulnerability is an important concept in network analysis related with the ability of the network to avoid intentional attacks or disruption when a failure is produced in some of its components. Often enough, the network is modeled as an undirected and unweighted graph in which vertices represent the processing elements and edges represent the communication channel between them. Different measures for graph vulnerability have been introduced so far to study different aspects of the graph behavior after removal of vertices or links such as connectivity, toughness, scattering number, binding number and integrity. In this paper, we consider residual closeness which is a new characteristic for graph vulnerability. Residual closeness is a more sensitive vulnerability measure than the other measures of vulnerability. We obtain exact values for closeness, vertex residual closeness (VRC) and normalized vertex residual closeness (NVRC) for some wheel related graphs namely helm and sunflower.en_US
dc.language.isoenen_US
dc.publisherIşık University Pressen_US
dc.relation.ispartofTWMS Journal Of Applied And Engineering Mathematicsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectNetwork vulnerabilityen_US
dc.subjectClosenessen_US
dc.subjectNetwork design and communicationen_US
dc.subjectStabilityen_US
dc.subjectCommunication networken_US
dc.subjectHelm graphen_US
dc.subjectSunflower graphen_US
dc.subjectNetworksen_US
dc.titleResidual closeness for helm and sunflower graphsen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume7
dc.identifier.issue2
dc.identifier.startpage209
dc.identifier.endpage220
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

info:eu-repo/semantics/openAccess
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess