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 ...
Hub-integrity of splitting graph and duplication of graph elements
(Işık University Press, 2016-01-08)
The hub-integrity of a graph G = (V (G), E(G)) is denoted as HI(G) and defined by HI(G) = min{|S| + m(G ? S), S is a hub set of G}, where m(G ? S) is the order of a maximum component of G ? S. In this paper, we discuss ...