Check out RSS, or use RSS reader to subscribe this item
Confirmation
Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China
For a connected graph G, connectivity is the minimum cardinality of an vertex-cut S in G such that G-S is disconnected or trivial(a graph is trivial if it contains only one vertex). This paper deals with the connectivity of strong product graphs and gives the lower bound for it.