The generalized connectivity of some networks

Rongxia Hao, a professor in Beijing jiaotong University. Before that, She received her doctor degree from Beijing Jiaotong University in 2002. 

Let $S\subseteq V(G)$ and $\kappa_{G}(S)$ denote the maximum number $r$ of edge-disjoint trees $T_{1}, T_{2}, \cdots, T_{r}$ in $G$ such that $V(T_{i})\bigcap V(T_{j})=S$ for any $i, j \in \{1, 2, \cdots, r\}$ and $i\neq j$. For an integer $k$ with $2\leq k\leq n$, the {\em generalized $k$-connectivity} of a graph $G$ is defined as $\kappa_{k}(G)= min\{\kappa_{G}(S)|S\subseteq V(G)$ and $|S|=k\}$. The generalized $k$-connectivity is a generalization of the traditional connectivity. In this talk, the results about the generalized $k$-connectivity of some networks such as Cayley graphs generated by the complete graphs, the alternating group graphs and the exchanged hypercubes for $k=3$ or $k=4$ are given.