SOME RESULTS FOR THE RUPTURE DEGREE

Basit Öğe Kaydı
dc.contributor.authorAytac, Aysun
dc.contributor.authorAksu, Hanife
dc.date.accessioned2019-10-27T22:06:36Z
dc.date.available2019-10-27T22:06:36Z
dc.date.issued2013
dc.departmentEge Üniversitesien_US
dc.description.abstractThe rupture degree of an incomplete connected graph G is defined by r(G) = max{w(G - S) - vertical bar S vertical bar - m(G - S) : S CV(G), w(G - S) >= 2}, where w(G - 5) denotes the number of components in the graph G - S and m(G - 5) is the order of the largest component of G - S. This parameter can be used to measure the vulnerability of a graph. In this paper, some bounds consisted of the relationships between the rupture degree and some vulnerability parameters on the rupture degree of a graph are given.en_US
dc.identifier.doi10.1142/S0129054113500366
dc.identifier.endpage1338en_US
dc.identifier.issn0129-0541
dc.identifier.issn1793-6373
dc.identifier.issn0129-0541en_US
dc.identifier.issn1793-6373en_US
dc.identifier.issue8en_US
dc.identifier.scopusqualityQ3en_US
dc.identifier.startpage1329en_US
dc.identifier.urihttps://doi.org/10.1142/S0129054113500366
dc.identifier.urihttps://hdl.handle.net/11454/48840
dc.identifier.volume24en_US
dc.identifier.wosWOS:000335513900009en_US
dc.identifier.wosqualityQ4en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherWorld Scientific Publ Co Pte Ltden_US
dc.relation.ispartofInternational Journal of Foundations of Computer Scienceen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectNetworksen_US
dc.subjectvulnerabilityen_US
dc.subjectconnectivityen_US
dc.subjectrupture degreeen_US
dc.titleSOME RESULTS FOR THE RUPTURE DEGREEen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu