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.
@article{bwmeta1.element.doi-10_7151_dmgt_1982,
author = {Yuefang Sun},
title = {A Sharp Lower Bound For The Generalized 3-Edge-Connectivity Of Strong Product Graphs},
journal = {Discussiones Mathematicae Graph Theory},
volume = {37},
year = {2017},
pages = {975-988},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1982}
}
Yuefang Sun. A Sharp Lower Bound For The Generalized 3-Edge-Connectivity Of Strong Product Graphs. Discussiones Mathematicae Graph Theory, Tome 37 (2017) pp. 975-988. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1982/