2 research outputs found
On Linkedness of Cartesian Product of Graphs
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
On linkedness in the Cartesian product of graphs
We study linkedness of the Cartesian product of graphs and prove that the product of an a-linked and a b-linked graph is (a + b - 1)-linked if the graphs are sufficiently large. Further bounds in terms of connectivity are shown. We determine linkedness of products of paths and products of cycles