The minimal size of a graph with given generalized 3-edge-connectivity.

Abstract: For

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

and

| S | g e q 2

,

l a m b d a (S)

is the maximum number of edge-disjoint trees connecting

S

in

G

. For an integer

k

with

2 l e q k l e q n

, the emph{generalized

k

-edge-connectivity}

l a m b d a_{k} (G)

of

G

is then defined as

l a m b d a_{k} (G) = m i n l a m b d a (S) : S s u b s e t e q V (G) a n d | S | = k

. It is also clear that when

| S | = 2

,

l a m b d a_{2} (G)

is nothing new but the standard edge-connectivity

l a m b d a (G)

of

G

. In this paper, graphs of order

n

such that

l a m b d a_{3} (G) = n - 3

is characterized. Furthermore, we determine the minimal number of edges of a graph of order

n

with

l a m b d a_{3} = 1, n - 3, n - 2

and give a sharp lower bound for

2 l e q l a m b d a_{3} l e q n - 4

.

Cited In (9)

This page was built for publication: The minimal size of a graph with given generalized 3-edge-connectivity.