Vulnerability of Mycielski graphs via residual closeness

Basit Öğe Kaydı
dc.contributor.authorTuraci, T.
dc.contributor.authorÖkten, M.
dc.date.accessioned2024-09-29T16:21:26Z
dc.date.available2024-09-29T16:21:26Z
dc.date.issued2015
dc.departmentKarabük Üniversitesien_US
dc.description.abstractThe vulnerability value of a communication network is the resistance of this communication network until some certain stations or communication links between these stations are disrupted and, thus communication interrupts. A communication network is modeled by a graph to measure the vulnerability as stations corresponding to the vertices and communication links corresponding to the edges. There are several types of vulnerability parameters depending upon the distance for each pair of two vertices. In this paper, closeness, vertex residual closeness (VRC) and normalized vertex residual closeness (NVRC) of some Mycielski graphs are calculated, furthermore upper and lower bounds are obtained.en_US
dc.identifier.endpage427en_US
dc.identifier.issn0381-7032
dc.identifier.scopus2-s2.0-84975253493en_US
dc.identifier.scopusqualityQ4en_US
dc.identifier.startpage419en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14619/9764
dc.identifier.volume118en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherCharles Babbage Research Centreen_US
dc.relation.ispartofArs Combinatoriaen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectClosenessen_US
dc.subjectConnectivityen_US
dc.subjectGraph vulnerabilityen_US
dc.subjectMycielski graphsen_US
dc.subjectNetwork design and communication: Residual closenessen_US
dc.titleVulnerability of Mycielski graphs via residual closenessen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu