On Linkedness of Cartesian Product of Graphs
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+b-1)-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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.