The minimal size of graphs with given pendant-tree connectivity
Mao, Yaping
Original · EN
The concept of pendant-tree k-connectivity τₖ(G) of a graph G, introduced by Hager in 1985, is a generalization of classical vertex-connectivity. Let f(n,k,ℓ) be the minimal number of edges of a graph G of order n with τₖ(G)=ℓ (1≤ ℓ≤ n-k). In this paper, we give some exact value or sharp bounds of the parameter f(n,k,ℓ).
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.