On linkedness in the Cartesian product of graphs

From MaRDI portal




Abstract: We study linkedness of Cartesian product of graphs and prove that the product of an a-linked and a b-linked graphs is (a+b1)-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.









This page was built for publication: On linkedness in the Cartesian product of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701356)