On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices

Abstract: The concept of maximum local connectivity

of a graph was introduced by Bollob'{a}s. One of the problems about it is to determine the largest number of edges

for graphs of order

n

that have local connectivity at most

e l l

. We consider a generalization of the above concept and problem. For

S s u b s e t e q V (G)

and

| S | g e q 2

, the emph{generalized local connectivity}

k a p p a (S)

is the maximum number of internally disjoint trees connecting

S

in

G

. The parameter

is called the emph{maximum generalized local connectivity} of

G

. This paper it to consider the problem of determining the largest number

of edges for graphs of order

n

that have maximum generalized local connectivity at most

e l l

. The exact value of

for

k = n, n - 1

is determined. For a general

k

, we construct a graph to obtain a sharp lower bound.

Recommendations

Cites Work

Cited In (15)

This page was built for publication: On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices