A vertex cut that separates the connected graph into components such that every components has at least g vertices is a Rg-vertex-cut.The g-extraconnectivity of G(written κg(G)) is the minimum cardinality of Rg-vertex-cut.The usual connectivity and superconnectivity of G correspond to κ0(G) andκ1(G)
respectively.In this paper
we will determine κg and characterize the Rg-vertex-atom-part for the first and second type Harary graphs.
关键词
Keywords
references
Najjar W,Gaudiot J L.Network resilience:A measure of network fault tolerance[J].IEEE Transactions on Computers,1990,39(2):174-181.
京公网安备11010802024621