Seminars_raw

The generalized connectivity of some networks

2019-05-13 00:00

Speaker: Rongxia Hao

unit:

Time: 2019-05-15 16:30-17:30

Venue: Room 202, 14th Building, Weijin Road Campus

starttime: 2019-05-15 16:30-17:30

Profile:


Theme:
The generalized connectivity of some networks
Time:
2019-05-15 16:30-17:30
Venue:
Room 202, 14th Building, Weijin Road Campus
Speaker:
Rongxia Hao

Profile

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

Abstract

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.


Contact us

Add:Building 58, The School of Mathematics, Tianjin University Beiyangyuan Campus,

        No. 135, Ya Guan Road, Jinnan District, Tianjin, PRC 

Tel:022-27402850   Mail:math@tju.edu.cn