Vulnerability: integrity of a middle graph
dc.contributor.author | Ataç, Aysun | |
dc.contributor.author | Çelik, Şebnem | |
dc.date.accessioned | 2017-01-17T07:26:05Z | |
dc.date.available | 2017-01-17T07:26:05Z | |
dc.date.issued | 2008 | |
dc.description | http://sjam.selcuk.edu.tr/sjam/article/view/199 | en_US |
dc.description.abstract | A communication network can be considered to be highly vulnerable to disruption if the destruction of a few elements can result in no member's being able to communicate with very many others. This idea suggests the concept of the integrity of a graph. The vertex-integrity of a graph G, denoted I(G), is defined by I(G)=min{|S|+m(G-S)} where m(G-S) denotes the maximum order of a component of G-S. In this paper we consider the integrity of middle graphs of specific families of graphs and combinations of these graphs. | en_US |
dc.identifier.citation | Ataç, A., Çelik, Ş. (2008). Vulnerability: integrity of a middle graph. Selcuk Journal of Applied Mathematics, 9 (1), 49-60. | en_US |
dc.identifier.endpage | 60 | |
dc.identifier.issn | 1302-7980 | en_US |
dc.identifier.startpage | 49 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12395/3889 | |
dc.identifier.volume | 9 | |
dc.language.iso | en | en_US |
dc.publisher | Selcuk University Research Center of Applied Mathematics | en_US |
dc.relation.ispartof | Selcuk Journal of Applied Mathematics | en_US |
dc.relation.publicationcategory | Makale - Kategori Belirlenecek | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.selcuk | 20240510_oaig | en_US |
dc.subject | Bir grafiğin orta grafiği | en_US |
dc.subject | Middle graph of a graph | en_US |
dc.subject | Bütünlük | en_US |
dc.subject | Integrity | en_US |
dc.subject | İstikrar | en_US |
dc.subject | Stability | en_US |
dc.subject | Bağlanabilirlik | en_US |
dc.subject | Connectivity | en_US |
dc.subject | Grafik teorisi | en_US |
dc.subject | Graph theory | en_US |
dc.subject | Savunmasızlık | en_US |
dc.subject | Vulnerability | en_US |
dc.title | Vulnerability: integrity of a middle graph | en_US |
dc.type | Article | en_US |