Browsing by Author "Tosun, MA"

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    Algorithm of Neighbor Isolated Scattering Number
    Tosun, MA; Aslan, E; Borandag, E
    Network 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.
  • No Thumbnail Available
    Item
    Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time
    Aslan, E; Tosun, MA
    Weighted graphs in graph theory are created by weighing different values depending on the importance of connections or centers in a graph model. Networks can be modeled with graphs such that the devices and centers correspond to the vertices and connections correspond to the edges. In these networks, weight can be assigned to the vertices for the workload and importance of the devices and centers, so that planning such as security and cost can be made in advance in the design of the network. Network reliability and security is an important issue in the computing area. There are several parameters for vulnerability measurement values of these networks modeled with graphs. We recommend the weighted conversion of the neighbor isolated tenacity parameter for this topic. It is known that tenacity, which is the basis of this parameter, is NP-hard. But polynomial solutions can be created in interval graphs, which is a special graph from the perfect graph class. In this article, polynomial time algorithm is given to calculate weighted neighbor isolated tenacity of the interval graphs.