Tosun, Mehmet AykutAslan, ErsinBorandag, Emin2024-11-072024-11-0720232667-8055https://doi.org/10.36306/konjes.1101410https://search.trdizin.gov.tr/tr/yayin/detay/1158366https://hdl.handle.net/11480/15114Network security and reliability is an essential part of computer networks. Network security has had to improve due to hackers. Business continuity is another reason for improvement. Networks can be modeled with graphs. Various parameters exist to measure the vulnerability of graphs, and hence of networks. In this paper, we consider neighbor isolated scattering number and an algorithm has been developed for the proposed vulnerability measurement parameter, which we recommend to measure for any graph and the algorithm is analyzed by software code metrics and have been shown to be useful. Thus, it has been concluded that humanpower will be saved by using an algorithm while measuring vulnerability for any graph.trinfo:eu-repo/semantics/openAccessGraph TheoryAlgorithmNetwork DesignVulnerabilityNeighbor Isolated Scattering Number (NIS)Article11110.36306/konjes.11014101158366WOS:001312971700011N/A