Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: strong product.

Sortuj według:

Ogranicz wyniki do:

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

100%

Sun Y.

Discussiones Mathematicae Graph Theory

2017

tom 37

nr 4

975-988

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Sun Y.

1 2017

Wyniki wyszukiwania

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