Ara
Toplam kayıt 2, listelenen: 1-2
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 ...
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 ...