Computing the rupture degree in composite graphs
| dc.contributor.author | Aytac A. | |
| dc.contributor.author | Odabas Z.N. | |
| dc.date.accessioned | 2019-10-27T08:34:54Z | |
| dc.date.available | 2019-10-27T08:34:54Z | |
| dc.date.issued | 2010 | |
| dc.department | Ege Üniversitesi | en_US |
| dc.description.abstract | The rupture degree of an incomplete connected graph G is defined by r(G) = max {w (G -S) - |S|m (G - S): S ? V (G), w (G - S) > 1} where w(G - S) is the number of components of G - S and m(G - S) is the order of a largest component of G - S. For the complete graph Kn, rupture degree is defined as 1 - n. This parameter can be used to measure the vulnerability of a graph. Rupture degree can reflect the vulnerability of graphs better than or independent of the other parameters. To some extent, it represents a trade-off between the amount of work done to damage the network and how badly the network is damaged. Computing the rupture degree of a graph is NP-complete. In this paper, we give formulas for the rupture degree of composition of some special graphs and we consider the relationships between the rupture degree and other vulnerability parameters. © 2010 World Scientific Publishing Company. | en_US |
| dc.identifier.doi | 10.1142/S012905411000726X | |
| dc.identifier.endpage | 319 | en_US |
| dc.identifier.issn | 0129-0541 | |
| dc.identifier.issn | 0129-0541 | en_US |
| dc.identifier.issue | 3 | en_US |
| dc.identifier.scopusquality | Q3 | en_US |
| dc.identifier.startpage | 311 | en_US |
| dc.identifier.uri | https://doi.org/10.1142/S012905411000726X | |
| dc.identifier.uri | https://hdl.handle.net/11454/27130 | |
| dc.identifier.volume | 21 | en_US |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartof | International Journal of Foundations of Computer Science | en_US |
| dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Connectivity | en_US |
| dc.subject | Network design and communication | en_US |
| dc.subject | Rupture degree | en_US |
| dc.subject | Vulnerability | en_US |
| dc.title | Computing the rupture degree in composite graphs | en_US |
| dc.type | Conference Object | en_US |
