Yukang Zhou

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Sorry, we do not have enough data to show an influence graph for this author.
Learn More
For a connected graph G = (V, E) , a subset F ⊆ V is called an R k -vertex-cut of G if G − F is disconnected and each vertex in V − F has at least k neighbors in G − F . The cardinality of the minimum R k -vertex-cut is the R k -vertex-connectivity of G and is denoted by κ ( G ). The conditional connectivity is a measure to explore the structure of networks(More)
  • 1