The minimal size of graphs with given pendant-tree connectivity

The concept of pendant-tree $k$-connectivity $τ_k(G)$ of a graph $G$, introduced by Hager in 1985, is a generalization of classical vertex-connectivity. Let $f(n,k,\ell)$ be the minimal number of edges of a graph $G$ of order $n$ with $τ_k(G)=\ell \ (1\leq \ell\leq n-k)$. In this paper, we give some exact value or sharp bounds of the parameter $f(n,k,\ell)$.

No reviews yet.

No comments yet.