Abstract
Let be a connected graph and be a non-negative integer. The -extra connectivity of is the minimum cardinality of a set of vertices in , if it exists, whose removal disconnects and leaves every component with more than vertices. The strong product of graphs and is the graph with vertex set , where two distinct vertices are adjacent in if and only if or for . In this paper, we obtain the -extra connectivity of the strong product of two paths, the strong product of a path and a cycle, and the strong product of two cycles.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.