Neighbor Rupture Degree of Some Middle Graphs

Gökşen BACAK TURAN; Meltem Ülkü ŞENOĞLU; Ferhan Nihan ALTUNDAĞ

Neighbor Rupture Degree of Some Middle Graphs

Date

2018

Authors

Gökşen BACAK TURAN

Meltem Ülkü ŞENOĞLU

Ferhan Nihan ALTUNDAĞ

Abstract

Networks have an important place in our daily lives. Internet networks, electricitynetworks, water networks, transportation networks, social networks and biologicalnetworks are some of the networks we run into every aspects of our lives. A networkconsists of centers connected by links. A network is represented when centers and connectionsmodelled by vertices and edges, respectively. In consequence of the failure ofsome centers or connection lines, measurement of the resistance of the network until thecommunication interrupted is called vulnerability of the network. In this study, neighborrupture degree which is a parameter that explores the vulnerability values of the resultinggraphs due to the failure of some centers of a communication network and its neighboringcenters becoming nonfunctional were applied to some middle graphs and neighbor rupturedegree of the M($Cn$); M($Pn$); M($K1;n$); M($Wn$); M($Pn$ $K2$) and M($Cn$ $K2$) have beenfound.