Ara
Toplam kayıt 7, listelenen: 1-7
Integrity and domination integrity of gear graphs
(Işık University Press, 2016-06-30)
C.A. Barefoot, et. al. [4] introduced the concept of the integrity of a graph. It is an useful measure of vulnerability and it is defined as follows. I(G) = min{|S| + m(G ? S) : S ? V (G)}, where m(G ? S) denotes the order ...
Residual closeness for helm and sunflower graphs
(Işık University Press, 2017-06-06)
Vulnerability is an important concept in network analysis related with the ability of the network to avoid intentional attacks or disruption when a failure is produced in some of its components. Often enough, the network ...
On arithmetic-geometric index (GA) and edge GA index
(Işık University Press, 2018)
Let G(V (G), E(G)) be a simple connected graph and dG(u) be the degree of the vertex u. Topological indices are numerical parameters of a graph which are invariant under graph isomorphisms. Recently, people are studying ...
Exponential domination of tree related graphs
(Işık University Press, 2019)
The well-known concept of domination in graphs is a good tool for analyzing situations that can be modeled by networks. Although a vertex in the graph can exert influence on, or dominate, all vertices in its immediate ...
Exponential domination of tree related graphs
(Işık University Press, 2019)
The well-known concept of domination in graphs is a good tool for analyzing situations that can be modeled by networks. Although a vertex in the graph can exert influence on, or dominate, all vertices in its immediate ...
On the average lower 2-domination number of a graph
(Işık University Press, 2019)
Computer scientists and network scientists want a speedy, reliable, and nonstop communication. In a communication network, the vulnerability measures the resistance of the network to disruption of operation after the failure ...
Vulnerability in networks
(Işık University Press, 2019)
Recently defined exponential domination number is reported as a new measure to graph vulnerability. It is a methodology, emerged in graph theory, for vulnerability analysis of networks. Also, it gives more sensitive results ...