Ataç, AysunÇelik, Şebnem2017-01-172017-01-172008Ataç, A., Çelik, Ş. (2008). Vulnerability: integrity of a middle graph. Selcuk Journal of Applied Mathematics, 9 (1), 49-60.1302-7980https://hdl.handle.net/20.500.12395/3889http://sjam.selcuk.edu.tr/sjam/article/view/199A 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.eninfo:eu-repo/semantics/openAccessBir grafiğin orta grafiğiMiddle graph of a graphBütünlükIntegrityİstikrarStabilityBağlanabilirlikConnectivityGrafik teorisiGraph theorySavunmasızlıkVulnerabilityArticle94960