A Sharp Lower Bound For The Generalized 3-Edge-Connectivity Of Strong Product Graphs

• Autorzy: Yuefang Sun
• Języki publikacji: EN

Abstrakty

EN

The generalized k-connectivity κk(G) of a graph G, mentioned by Hager in 1985, is a natural generalization of the path-version of the classical connectivity. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k-edge-connectivity which is defined as λk(G) = min{λG(S) | S ⊆ V (G) and |S| = k}, where λG(S) denote the maximum number ℓ of pairwise edge-disjoint trees T1, T2, . . . , Tℓ in G such that S ⊆ V (Ti) for 1 ≤ i ≤ ℓ. In this paper we get a sharp lower bound for the generalized 3-edge-connectivity of the strong product of any two connected graphs.

Słowa kluczowe

EN

generalized connectivity; generalized edge-connectivity; strong product.

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 4
• Strony: 975-988

Daty

wydano

2017-11-27

otrzymano

2016-02-13

poprawiono

2016-08-17

zaakceptowano

2016-08-17

online

2017-09-02

Twórcy

autor

Yuefang Sun

• 312000, P.R.,

Identyfikatory

DOI

10.7151/dmgt.1982