Yazar "Aytac, Vecdi" seçeneğine göre listele

Listeleniyor 1 - 3 / 3
  • Küçük Resim Yok
    Öğe
    Closeness centrality in some splitting networks
    (Inst Mathematics & Computer Science Acad, 2018) Aytac, Vecdi; Turaci, Tufan
    A central issue in the analysis of complex networks is the assessment of their robustness and vulnerability. A variety of measures have been proposed in the literature to quantify the robustness of networks, and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. Centrality parameters play an important role in the field of network analysis. Numerous studies have proposed and analyzed several centrality measures. We consider closeness centrality which is defined as the total graph-theoretic distance to all other vertices in the graph. In this paper, closeness centrality of some splitting graphs is calculated, and exact values are obtained.
  • Küçük Resim Yok
    Öğe
    RELATIONSHIPS BETWEEN VERTEX ATTACK TOLERANCE AND OTHER VULNERABILITY PARAMETERS
    (Edp Sciences S A, 2017) Aytac, Vecdi; Turaci, Tufan
    Let G(V,E) be a simple undirected graph. Recently, the vertex attack tolerance (VAT) of G has been defined as ?(G) = min {|S| / |V-S-Cmax (G-S)|+1 : S ? V} , where Cmax(G - S) is the order of a largest connected component in G - S. This parameter has been used to measure the vulnerability of networks. The vertex attack tolerance is the only measure that fully captures both the major bottlenecks of a network and the resulting component size distribution upon targeted node attacks. In this article, the relationships between the vertex attack tolerance and some other vulnerability parameters, namely connectivity, toughness, integrity, scattering number, tenacity, binding number and rupture degree have been determined.
  • Küçük Resim Yok
    Öğe
    RESIDUAL CLOSENESS OF SPLITTING NETWORKS
    (Charles Babbage Res Ctr, 2017) Turaci, Tufan; Aytac, Vecdi
    Networks are important structures and appear in many different applications and settings. The vulnerability value of a communication network shows the resistance of the network after the disruption of some centers or connection lines until a communication breakdown. Centrality parameters play an important role in the field of network analysis. Numerous studies have proposed and analyzed several centrality measures. These concept measures 'the importance of a node's position in a network. In this paper, vertex residual closeness( VRC) and normalized vertex residual closeness(NVRC) of some Splitting networks modeling by splitting graph are obtained.