A survey on the generalized connectivity of graphs

Abstract

The generalized $k$-connectivity $\hat{I}{º}_k(G)$ of a graph $G$ was introduced by Hager before 1985. As its a natural counterpart, we introduced the concept of generalized edge-connectivity $\hat{I}{»}_k(G)$, recently. In this paper we summarize the known results on the generalized connectivity and generalized edge-connectivity. After an introductory section, the paper is then divided into nine sections: the generalized (edge-)connectivity of some graph classes, algorithms and computational complexity, sharp bounds of $\hat{I}{º}_k(G)$ and $\hat{I}{»}_k(G)$, graphs with large generalized (edge-)connectivity, Nordhaus-Gaddum-type results, graph operations, extremal problems, and some results for random graphs and multigraphs. It also contains some conjectures and open problems for further studies.

51 pages. arXiv admin note: text overlap with arXiv:1303.3881 by other authors