On vulnerability and edge parameters in networks

The importance of communication and data transfer is gradually increasing in our daily life. In order for communication to be efficient, it is required to be uninterrupted, reliable and fast. Today, many problems that have become complex can be made simpler and more understandable by modeling. These models can be examined and studied with vulnerability parameters, which have an important place in graph theory. In this thesis, the edge parameters in graphs; It has been studied on Edge Scattering Number, Edge Rupture Degree, Edge Integrity. Algorithms were designed for each of the specified parameters. The algorithms designed are explained in detail.