VULNERABIILITY OF MYCIELSKI GRAPHS VIA RESIDUAL CLOSENESS

Basit Öğe Kaydı
dc.authoridTURACI, TUFAN/0000-0002-6159-0935
dc.contributor.authorTuraci, Tufan
dc.contributor.authorOkten, Mukaddes
dc.date.accessioned2024-09-29T16:11:24Z
dc.date.available2024-09-29T16:11:24Z
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 (NV RC) 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.startpage419en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14619/8416
dc.identifier.volume118en_US
dc.identifier.wosWOS:000351784600035en_US
dc.identifier.wosqualityQ4en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherCharles Babbage Res Ctren_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.subjectGraph vulnerabilityen_US
dc.subjectConnectivityen_US
dc.subjectNetwork design and communicationen_US
dc.subjectResidual closenessen_US
dc.subjectClosenessen_US
dc.subjectMycielski graphsen_US
dc.titleVULNERABIILITY OF MYCIELSKI GRAPHS VIA RESIDUAL CLOSENESSen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu