On Linkedness of Cartesian Product of Graphs
classification
🧮 math.CO
keywords
productgraphslinkedlinkednesscartesianboundsconnectivitycycles
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.