Abstract
We study linkedness of Cartesian product of graphs and prove that the product of an -linked and a -linked graphs is -linked if the graphs are sufficiently large. Further bounds in terms of connectivity are shown. We determine linkedness of product of paths and product of 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.