Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs

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

Abstrakty

EN

The generalized k-connectivity κk(G) of a graph G was introduced by Hager in 1985. 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{λ(S) : S ⊆ V (G) and |S| = k}, where λ(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 study the generalized edge- connectivity of product graphs and obtain sharp upper bounds for the generalized 3-edge-connectivity of Cartesian product graphs and strong product graphs. Among our results, some special cases are also discussed.

Słowa kluczowe

EN

generalized edge-connectivity; Cartesian product; strong product; lexicographic product

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2016
• Tom: 36
• Numer: 4
• Strony: 833-843

Daty

wydano

2016-11-01

otrzymano

2015-09-24

poprawiono

2015-12-16

zaakceptowano

2015-12-16

online

2016-10-21

Twórcy

autor

Yuefang Sun

• Department of Mathematics Shaoxing University Zhejiang 312000, P.R.,

Identyfikatory

DOI

10.7151/dmgt.1924