On the edge-connectivity and restricted edge-connectivity of a product of graphs
The product graph Gm ∗ Gp of two given graphs Gm and Gp was defined by Bermond et al. [Large graphs with given degree and diameter II, J. Combin. Theory Ser. B 36 (1984) 32–48]. For this kind of graphs we provide bounds for two connectivity parameters and , edge-connectivity and restricted edge-conn...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2007 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/163740 |
| Acceso en línea: | https://hdl.handle.net/11441/163740 https://doi.org/10.1016/j.dam.2007.06.014 |
| Access Level: | acceso abierto |
| Palabra clave: | Edge-connectivity Restricted edge-connectivity Permutation graphs Cartesian product |
| Sumario: | The product graph Gm ∗ Gp of two given graphs Gm and Gp was defined by Bermond et al. [Large graphs with given degree and diameter II, J. Combin. Theory Ser. B 36 (1984) 32–48]. For this kind of graphs we provide bounds for two connectivity parameters and , edge-connectivity and restricted edge-connectivity, respectively), and state sufficient conditions to guarantee optimal values of these parameters. Moreover, we compare our results with other previous related ones for permutation graphs and cartesian product graphs, obtaining several extensions and improvements. In this regard, for any two connected graphs Gm, Gp of minimum degrees (Gm), (Gp), respectively, we show that (Gm ∗ Gp) is lower bounded by both (Gm) + (Gp) and (Gp) + (Gm), an improvement of what is known for the edge-connectivity of Gm × Gp. |
|---|