On linkedness in the Cartesian product of graphs |
| |
Authors: | Gábor Mészáros |
| |
Institution: | 1.Central European University,Budapest,Hungary |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |