On the generalized (edge-)connectivity of graphs

The generalized $k$-connectivity $κ_k(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984. It is natural to introduce the concept of generalized $k$-edge-connectivity $λ_k(G)$. For general $k$, the generalized $k$-edge-connectivity of a complete graph is obtained. For $k\geq 3$, tight upper and lower bounds of $κ_k(G)$ and $λ_k(G)$ are given for a connected graph $G$ of order $n$, that is, $1\leq κ_k(G)\leq n-\lceil\frac{k}{2}\rceil$ and $1\leq λ_k(G)\leq n-\lceil\frac{k}{2}\rceil$. Graphs of order $n$ such that $κ_k(G)=n-\lceil\frac{k}{2}\rceil$ and $λ_k(G)=n-\lceil\frac{k}{2}\rceil$ are characterized, respectively. Nordhaus-Gaddum-type results for the generalized $k$-connectivity are also obtained. For $k=3$, we study the relation between the edge-connectivity and the generalized 3-edge-connectivity of a graph. Upper and lower bounds of $λ_3(G)$ for a graph $G$ in terms of the edge-connectivity $λ$ of $G$ are obtained, that is, $\frac{3λ-2}{4}\leq λ_3(G)\leq λ$, and two graph classes are given showing that the upper and lower bounds are tight. From these bounds, we obtain that $λ(G)-1\leq λ_3(G)\leq λ(G)$ if $G$ is a connected planar graph, and the relation between the generalized 3-connectivity and generalized 3-edge-connectivity of a graph and its line graph.

No reviews yet.

No comments yet.