On Linkedness of Cartesian Product of Graphs
Combinatorics
2014-07-29 v2
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.
Keywords
Cite
@article{arxiv.1401.7928,
title = {On Linkedness of Cartesian Product of Graphs},
author = {Gabor Meszaros},
journal= {arXiv preprint arXiv:1401.7928},
year = {2014}
}