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

Yuefang Sun. "A Sharp Lower Bound For The Generalized 3-Edge-Connectivity Of Strong Product Graphs." Discussiones Mathematicae Graph Theory 37.4 (2017): 975-988. <http://eudml.org/doc/288342>.

@article{YuefangSun2017,
abstract = {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.},
author = {Yuefang Sun},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {generalized connectivity; generalized edge-connectivity; strong product.},
language = {eng},
number = {4},
pages = {975-988},
title = {A Sharp Lower Bound For The Generalized 3-Edge-Connectivity Of Strong Product Graphs},
url = {http://eudml.org/doc/288342},
volume = {37},
year = {2017},
}

TY - JOUR
AU - Yuefang Sun
TI - A Sharp Lower Bound For The Generalized 3-Edge-Connectivity Of Strong Product Graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2017
VL - 37
IS - 4
SP - 975
EP - 988
AB - 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.
LA - eng
KW - generalized connectivity; generalized edge-connectivity; strong product.
UR - http://eudml.org/doc/288342
ER -