Generalized 3-edge-connectivity of Cartesian product graphs

@article{Sun2015,
abstract = {The generalized $k$-connectivity $\kappa _\{k\}(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized $k$-edge-connectivity which is defined as $\lambda _k(G) = \min \lbrace \lambda (S)\colon S \subseteq V(G)$ and $|S|= k\rbrace $, where $\lambda (S)$ denotes the maximum number $\ell $ of pairwise edge-disjoint trees $T_1, T_2, \ldots , T_\{\ell \}$ in $G$ such that $S\subseteq V(T_i)$ for $1\le i\le \ell $. In this paper we prove that for any two connected graphs $G$ and $H$ we have $\lambda _3(G\square H)\ge \lambda _3(G)+\lambda _3(H)$, where $G\square H$ is the Cartesian product of $G$ and $H$. Moreover, the bound is sharp. We also obtain the precise values for the generalized 3-edge-connectivity of the Cartesian product of some special graph classes.},
author = {Sun, Yuefang},
journal = {Czechoslovak Mathematical Journal},
keywords = {generalized connectivity; generalized edge-connectivity; Cartesian product},
language = {eng},
number = {1},
pages = {107-117},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Generalized 3-edge-connectivity of Cartesian product graphs},
url = {http://eudml.org/doc/270044},
volume = {65},
year = {2015},
}

TY - JOUR
AU - Sun, Yuefang
TI - Generalized 3-edge-connectivity of Cartesian product graphs
JO - Czechoslovak Mathematical Journal
PY - 2015
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 65
IS - 1
SP - 107
EP - 117
AB - The generalized $k$-connectivity $\kappa _{k}(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized $k$-edge-connectivity which is defined as $\lambda _k(G) = \min \lbrace \lambda (S)\colon S \subseteq V(G)$ and $|S|= k\rbrace $, where $\lambda (S)$ denotes the maximum number $\ell $ of pairwise edge-disjoint trees $T_1, T_2, \ldots , T_{\ell }$ in $G$ such that $S\subseteq V(T_i)$ for $1\le i\le \ell $. In this paper we prove that for any two connected graphs $G$ and $H$ we have $\lambda _3(G\square H)\ge \lambda _3(G)+\lambda _3(H)$, where $G\square H$ is the Cartesian product of $G$ and $H$. Moreover, the bound is sharp. We also obtain the precise values for the generalized 3-edge-connectivity of the Cartesian product of some special graph classes.
LA - eng
KW - generalized connectivity; generalized edge-connectivity; Cartesian product
UR - http://eudml.org/doc/270044
ER -