Abstract
The direct product of graphs and is the graph, denoted as , with vertex set , where vertices and are adjacent in if and . The edge connectivity of a graph , denoted as , is the size of a minimum edge-cut in . We introduce a function and prove the following formula %for the edge-connectivity of direct products We also describe the structure of every minimum edge-cut in .
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.